./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/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 7c74e01d3afb0ed9f191585ecc33df16c773e5f5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-69874e2 [2020-12-01 15:25:03,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:25:03,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:25:03,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:25:03,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:25:03,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:25:03,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:25:03,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:25:03,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:25:03,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:25:03,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:25:03,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:25:03,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:25:03,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:25:03,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:25:03,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:25:03,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:25:03,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:25:03,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:25:03,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:25:03,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:25:03,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:25:03,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:25:03,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:25:03,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:25:03,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:25:03,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:25:03,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:25:03,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:25:03,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:25:03,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:25:03,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:25:03,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:25:03,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:25:03,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:25:03,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:25:03,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:25:03,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:25:03,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:25:03,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:25:03,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:25:03,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:25:03,608 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:25:03,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:25:03,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:25:03,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:25:03,611 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:25:03,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:25:03,612 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:25:03,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:25:03,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:25:03,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:25:03,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:25:03,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:25:03,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:25:03,614 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:25:03,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:25:03,615 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:25:03,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:25:03,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:25:03,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:25:03,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:25:03,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:25:03,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:25:03,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:25:03,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:25:03,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:25:03,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:25:03,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:25:03,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:25:03,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:25:03,621 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_cafc303a-9086-4bb9-beb4-3805c95edb23/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_cafc303a-9086-4bb9-beb4-3805c95edb23/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 -> 7c74e01d3afb0ed9f191585ecc33df16c773e5f5 [2020-12-01 15:25:03,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:25:03,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:25:03,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:25:03,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:25:03,925 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:25:03,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2020-12-01 15:25:04,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/data/80ad1154f/505083895cb348749bad20e6f770a3e5/FLAG5d01db861 [2020-12-01 15:25:04,596 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:25:04,597 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/sv-benchmarks/c/pthread-wmm/mix047_tso.opt.i [2020-12-01 15:25:04,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/data/80ad1154f/505083895cb348749bad20e6f770a3e5/FLAG5d01db861 [2020-12-01 15:25:04,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/data/80ad1154f/505083895cb348749bad20e6f770a3e5 [2020-12-01 15:25:04,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:25:04,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:25:04,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:25:04,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:25:04,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:25:04,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:25:04" (1/1) ... [2020-12-01 15:25:04,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fbacaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:04, skipping insertion in model container [2020-12-01 15:25:04,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:25:04" (1/1) ... [2020-12-01 15:25:04,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:25:04,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:25:05,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:25:05,478 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:25:05,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:25:05,666 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:25:05,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05 WrapperNode [2020-12-01 15:25:05,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:25:05,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:25:05,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:25:05,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:25:05,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:25:05,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:25:05,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:25:05,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:25:05,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... [2020-12-01 15:25:05,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:25:05,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:25:05,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:25:05,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:25:05,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/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-12-01 15:25:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:25:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 15:25:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:25:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:25:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-01 15:25:05,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-01 15:25:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-01 15:25:05,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-01 15:25:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-01 15:25:05,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-01 15:25:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-01 15:25:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-01 15:25:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:25:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 15:25:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:25:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:25:05,910 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 15:25:08,003 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:25:08,003 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-01 15:25:08,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:25:08 BoogieIcfgContainer [2020-12-01 15:25:08,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:25:08,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:25:08,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:25:08,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:25:08,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:25:04" (1/3) ... [2020-12-01 15:25:08,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667c6fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:25:08, skipping insertion in model container [2020-12-01 15:25:08,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:25:05" (2/3) ... [2020-12-01 15:25:08,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667c6fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:25:08, skipping insertion in model container [2020-12-01 15:25:08,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:25:08" (3/3) ... [2020-12-01 15:25:08,018 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2020-12-01 15:25:08,037 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 15:25:08,037 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:25:08,041 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:25:08,042 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 15:25:08,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,107 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,107 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,110 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,110 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,115 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,117 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,124 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,125 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,126 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,127 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,129 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,142 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,143 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,151 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,151 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,153 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,154 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,156 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,158 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:25:08,163 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-01 15:25:08,176 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-01 15:25:08,215 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:25:08,215 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:25:08,215 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:25:08,215 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:25:08,216 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:25:08,216 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:25:08,216 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:25:08,216 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:25:08,235 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 15:25:08,237 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-12-01 15:25:08,241 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-12-01 15:25:08,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-12-01 15:25:08,333 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-12-01 15:25:08,333 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-01 15:25:08,357 INFO L84 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-12-01 15:25:08,367 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-12-01 15:25:08,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:08,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:08,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:08,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:08,715 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:08,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:08,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:08,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:08,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,199 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,314 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:09,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:09,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:09,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:10,000 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-12-01 15:25:10,117 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-12-01 15:25:10,299 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-12-01 15:25:10,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:10,479 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:10,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:10,488 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:10,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:10,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:10,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:10,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:10,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:10,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:10,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:10,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-01 15:25:10,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:11,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:11,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:11,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:25:11,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:11,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:11,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:11,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:11,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:11,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:11,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:11,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:11,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:11,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:11,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-01 15:25:11,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:12,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:12,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:12,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:12,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:12,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-01 15:25:12,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:12,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:12,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:12,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:12,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:25:12,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:12,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:12,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:12,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:12,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:13,203 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-12-01 15:25:13,316 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-01 15:25:13,800 WARN L197 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2020-12-01 15:25:13,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-12-01 15:25:13,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:14,276 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2020-12-01 15:25:14,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:14,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:14,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,548 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:14,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,549 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:25:14,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:14,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:14,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:14,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:14,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:15,514 WARN L197 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-12-01 15:25:15,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-01 15:25:15,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:15,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-01 15:25:15,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:16,608 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2020-12-01 15:25:18,472 WARN L197 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2020-12-01 15:25:18,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:18,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:18,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:18,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-01 15:25:18,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-01 15:25:18,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-12-01 15:25:18,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,521 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-01 15:25:18,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-12-01 15:25:18,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-12-01 15:25:18,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:18,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-12-01 15:25:18,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-01 15:25:18,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-12-01 15:25:18,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:25:18,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:25:18,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:18,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:18,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-12-01 15:25:18,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:21,820 WARN L197 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 374 DAG size of output: 279 [2020-12-01 15:25:22,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-12-01 15:25:22,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,013 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,017 INFO L398 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-12-01 15:25:22,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,019 INFO L398 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-12-01 15:25:22,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,020 INFO L398 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-12-01 15:25:22,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:25:22,056 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,804 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:25:22,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:22,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,837 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-12-01 15:25:22,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:22,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:22,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,845 INFO L398 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-12-01 15:25:22,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,847 INFO L398 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-12-01 15:25:22,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:22,848 INFO L398 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-12-01 15:25:22,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:25:23,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,271 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-12-01 15:25:23,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,311 INFO L398 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-12-01 15:25:23,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,313 INFO L398 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-12-01 15:25:23,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,314 INFO L398 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-12-01 15:25:23,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-12-01 15:25:23,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:25:23,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-01 15:25:23,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,463 INFO L398 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-12-01 15:25:23,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,465 INFO L398 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-12-01 15:25:23,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,467 INFO L398 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-12-01 15:25:23,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:23,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:25:23,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-01 15:25:23,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:25:24,077 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-01 15:25:24,202 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-01 15:25:24,338 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-01 15:25:24,476 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-12-01 15:25:25,052 WARN L197 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-01 15:25:25,341 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-01 15:25:25,858 WARN L197 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-12-01 15:25:26,098 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-12-01 15:25:26,104 INFO L131 LiptonReduction]: Checked pairs total: 7608 [2020-12-01 15:25:26,104 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-12-01 15:25:26,110 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-12-01 15:25:26,450 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-12-01 15:25:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-12-01 15:25:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-01 15:25:26,461 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:26,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:26,463 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash -634987665, now seen corresponding path program 1 times [2020-12-01 15:25:26,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:26,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116601459] [2020-12-01 15:25:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:26,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116601459] [2020-12-01 15:25:26,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:26,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:25:26,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504736959] [2020-12-01 15:25:26,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:25:26,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:26,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:25:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:25:26,895 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-12-01 15:25:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:27,046 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-12-01 15:25:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:25:27,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-01 15:25:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:27,108 INFO L225 Difference]: With dead ends: 3082 [2020-12-01 15:25:27,109 INFO L226 Difference]: Without dead ends: 2602 [2020-12-01 15:25:27,110 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-12-01 15:25:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-12-01 15:25:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-12-01 15:25:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-12-01 15:25:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-12-01 15:25:27,382 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-12-01 15:25:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:27,384 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-12-01 15:25:27,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:25:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-12-01 15:25:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 15:25:27,399 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:27,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:27,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:25:27,400 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1880009126, now seen corresponding path program 1 times [2020-12-01 15:25:27,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:27,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501128657] [2020-12-01 15:25:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:27,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501128657] [2020-12-01 15:25:27,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:27,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:25:27,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576267981] [2020-12-01 15:25:27,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:25:27,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:25:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:25:27,725 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-12-01 15:25:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:27,834 INFO L93 Difference]: Finished difference Result 2762 states and 10352 transitions. [2020-12-01 15:25:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:25:27,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-01 15:25:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:27,864 INFO L225 Difference]: With dead ends: 2762 [2020-12-01 15:25:27,864 INFO L226 Difference]: Without dead ends: 2282 [2020-12-01 15:25:27,865 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-12-01 15:25:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-12-01 15:25:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-12-01 15:25:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-12-01 15:25:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-12-01 15:25:28,018 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 12 [2020-12-01 15:25:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:28,018 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-12-01 15:25:28,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:25:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-12-01 15:25:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 15:25:28,023 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:28,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:28,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:25:28,024 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:28,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash 970458918, now seen corresponding path program 1 times [2020-12-01 15:25:28,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:28,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651309291] [2020-12-01 15:25:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:28,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651309291] [2020-12-01 15:25:28,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:28,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:25:28,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68636422] [2020-12-01 15:25:28,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:25:28,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:25:28,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:25:28,261 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 5 states. [2020-12-01 15:25:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:28,459 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-12-01 15:25:28,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:25:28,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-12-01 15:25:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:28,489 INFO L225 Difference]: With dead ends: 2538 [2020-12-01 15:25:28,490 INFO L226 Difference]: Without dead ends: 2218 [2020-12-01 15:25:28,490 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-12-01 15:25:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-12-01 15:25:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-12-01 15:25:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-12-01 15:25:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-12-01 15:25:28,666 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-12-01 15:25:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:28,667 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-12-01 15:25:28,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:25:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-12-01 15:25:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 15:25:28,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:28,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:28,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:25:28,671 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -40609003, now seen corresponding path program 1 times [2020-12-01 15:25:28,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:28,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776726950] [2020-12-01 15:25:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:28,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776726950] [2020-12-01 15:25:28,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:28,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:25:28,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232718011] [2020-12-01 15:25:28,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:25:28,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:25:28,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:25:28,862 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 5 states. [2020-12-01 15:25:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:29,064 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-12-01 15:25:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:25:29,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-01 15:25:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:29,091 INFO L225 Difference]: With dead ends: 2410 [2020-12-01 15:25:29,092 INFO L226 Difference]: Without dead ends: 2154 [2020-12-01 15:25:29,092 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-12-01 15:25:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-12-01 15:25:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-12-01 15:25:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-12-01 15:25:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-12-01 15:25:29,195 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-12-01 15:25:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:29,196 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-12-01 15:25:29,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:25:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-12-01 15:25:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 15:25:29,200 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:29,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:29,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:25:29,201 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1258925188, now seen corresponding path program 1 times [2020-12-01 15:25:29,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:29,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844565528] [2020-12-01 15:25:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:29,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844565528] [2020-12-01 15:25:29,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:29,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:25:29,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813626943] [2020-12-01 15:25:29,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:25:29,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:25:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:25:29,327 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 5 states. [2020-12-01 15:25:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:29,468 INFO L93 Difference]: Finished difference Result 2322 states and 8524 transitions. [2020-12-01 15:25:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:25:29,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-01 15:25:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:29,493 INFO L225 Difference]: With dead ends: 2322 [2020-12-01 15:25:29,493 INFO L226 Difference]: Without dead ends: 2066 [2020-12-01 15:25:29,494 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-12-01 15:25:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-12-01 15:25:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2020-12-01 15:25:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-12-01 15:25:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 7728 transitions. [2020-12-01 15:25:29,583 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 7728 transitions. Word has length 16 [2020-12-01 15:25:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:29,584 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 7728 transitions. [2020-12-01 15:25:29,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:25:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 7728 transitions. [2020-12-01 15:25:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:25:29,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:29,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:29,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:25:29,590 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1060358638, now seen corresponding path program 1 times [2020-12-01 15:25:29,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:29,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414426467] [2020-12-01 15:25:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:29,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414426467] [2020-12-01 15:25:29,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:29,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:25:29,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975609701] [2020-12-01 15:25:29,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:25:29,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:25:29,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:25:29,788 INFO L87 Difference]: Start difference. First operand 2066 states and 7728 transitions. Second operand 6 states. [2020-12-01 15:25:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:30,031 INFO L93 Difference]: Finished difference Result 2702 states and 9916 transitions. [2020-12-01 15:25:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:25:30,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-01 15:25:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:30,058 INFO L225 Difference]: With dead ends: 2702 [2020-12-01 15:25:30,058 INFO L226 Difference]: Without dead ends: 2450 [2020-12-01 15:25:30,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:25:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-12-01 15:25:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2394. [2020-12-01 15:25:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-12-01 15:25:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 8888 transitions. [2020-12-01 15:25:30,167 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 8888 transitions. Word has length 17 [2020-12-01 15:25:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:30,168 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 8888 transitions. [2020-12-01 15:25:30,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:25:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 8888 transitions. [2020-12-01 15:25:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:25:30,175 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:30,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:30,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:25:30,176 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash -27657637, now seen corresponding path program 1 times [2020-12-01 15:25:30,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:30,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783643868] [2020-12-01 15:25:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:30,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783643868] [2020-12-01 15:25:30,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:30,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:25:30,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353942281] [2020-12-01 15:25:30,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:25:30,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:25:30,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:25:30,422 INFO L87 Difference]: Start difference. First operand 2394 states and 8888 transitions. Second operand 8 states. [2020-12-01 15:25:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:30,673 INFO L93 Difference]: Finished difference Result 2810 states and 10124 transitions. [2020-12-01 15:25:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:25:30,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-01 15:25:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:30,712 INFO L225 Difference]: With dead ends: 2810 [2020-12-01 15:25:30,718 INFO L226 Difference]: Without dead ends: 2354 [2020-12-01 15:25:30,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:25:30,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2020-12-01 15:25:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1898. [2020-12-01 15:25:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-12-01 15:25:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6944 transitions. [2020-12-01 15:25:30,815 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6944 transitions. Word has length 18 [2020-12-01 15:25:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:30,815 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6944 transitions. [2020-12-01 15:25:30,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:25:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6944 transitions. [2020-12-01 15:25:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:25:30,853 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:30,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:25:30,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:25:30,857 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1306898107, now seen corresponding path program 1 times [2020-12-01 15:25:30,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:30,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831016197] [2020-12-01 15:25:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:31,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831016197] [2020-12-01 15:25:31,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:31,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:25:31,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168278791] [2020-12-01 15:25:31,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:25:31,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:25:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:25:31,009 INFO L87 Difference]: Start difference. First operand 1898 states and 6944 transitions. Second operand 4 states. [2020-12-01 15:25:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:31,067 INFO L93 Difference]: Finished difference Result 1970 states and 6574 transitions. [2020-12-01 15:25:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:25:31,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-01 15:25:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:31,077 INFO L225 Difference]: With dead ends: 1970 [2020-12-01 15:25:31,078 INFO L226 Difference]: Without dead ends: 1490 [2020-12-01 15:25:31,078 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-12-01 15:25:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-12-01 15:25:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-12-01 15:25:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-12-01 15:25:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4922 transitions. [2020-12-01 15:25:31,142 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4922 transitions. Word has length 18 [2020-12-01 15:25:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:31,142 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4922 transitions. [2020-12-01 15:25:31,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:25:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4922 transitions. [2020-12-01 15:25:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:25:31,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:31,148 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-12-01 15:25:31,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:25:31,149 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -467514533, now seen corresponding path program 1 times [2020-12-01 15:25:31,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:31,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612822539] [2020-12-01 15:25:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:31,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612822539] [2020-12-01 15:25:31,228 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:31,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:25:31,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976057405] [2020-12-01 15:25:31,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:25:31,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:25:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:25:31,230 INFO L87 Difference]: Start difference. First operand 1490 states and 4922 transitions. Second operand 5 states. [2020-12-01 15:25:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:31,325 INFO L93 Difference]: Finished difference Result 1282 states and 3882 transitions. [2020-12-01 15:25:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:25:31,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-01 15:25:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:31,332 INFO L225 Difference]: With dead ends: 1282 [2020-12-01 15:25:31,332 INFO L226 Difference]: Without dead ends: 982 [2020-12-01 15:25:31,333 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-12-01 15:25:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2020-12-01 15:25:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2020-12-01 15:25:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-12-01 15:25:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2920 transitions. [2020-12-01 15:25:31,371 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2920 transitions. Word has length 19 [2020-12-01 15:25:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:31,372 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 2920 transitions. [2020-12-01 15:25:31,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:25:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2920 transitions. [2020-12-01 15:25:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:25:31,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:31,376 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-12-01 15:25:31,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:25:31,376 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1857918314, now seen corresponding path program 1 times [2020-12-01 15:25:31,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:31,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111716989] [2020-12-01 15:25:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:31,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111716989] [2020-12-01 15:25:31,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:31,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:25:31,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179251746] [2020-12-01 15:25:31,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:25:31,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:25:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:25:31,475 INFO L87 Difference]: Start difference. First operand 982 states and 2920 transitions. Second operand 4 states. [2020-12-01 15:25:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:31,524 INFO L93 Difference]: Finished difference Result 1445 states and 4142 transitions. [2020-12-01 15:25:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:25:31,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-01 15:25:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:31,531 INFO L225 Difference]: With dead ends: 1445 [2020-12-01 15:25:31,531 INFO L226 Difference]: Without dead ends: 1002 [2020-12-01 15:25:31,532 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-12-01 15:25:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-12-01 15:25:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 970. [2020-12-01 15:25:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-12-01 15:25:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2734 transitions. [2020-12-01 15:25:31,573 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2734 transitions. Word has length 20 [2020-12-01 15:25:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:31,574 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 2734 transitions. [2020-12-01 15:25:31,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:25:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2734 transitions. [2020-12-01 15:25:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:25:31,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:31,578 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-12-01 15:25:31,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:25:31,578 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -21138615, now seen corresponding path program 1 times [2020-12-01 15:25:31,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:31,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933505868] [2020-12-01 15:25:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:31,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933505868] [2020-12-01 15:25:31,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:31,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:25:31,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74660263] [2020-12-01 15:25:31,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:25:31,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:31,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:25:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:25:31,750 INFO L87 Difference]: Start difference. First operand 970 states and 2734 transitions. Second operand 6 states. [2020-12-01 15:25:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:31,863 INFO L93 Difference]: Finished difference Result 1770 states and 4731 transitions. [2020-12-01 15:25:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:25:31,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-01 15:25:31,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:31,868 INFO L225 Difference]: With dead ends: 1770 [2020-12-01 15:25:31,869 INFO L226 Difference]: Without dead ends: 1052 [2020-12-01 15:25:31,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:25:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-12-01 15:25:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 954. [2020-12-01 15:25:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2020-12-01 15:25:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 2536 transitions. [2020-12-01 15:25:31,905 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 2536 transitions. Word has length 21 [2020-12-01 15:25:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:31,905 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 2536 transitions. [2020-12-01 15:25:31,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:25:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 2536 transitions. [2020-12-01 15:25:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:25:31,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:31,909 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-12-01 15:25:31,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:25:31,909 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -652683463, now seen corresponding path program 1 times [2020-12-01 15:25:31,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:31,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502948613] [2020-12-01 15:25:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:32,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502948613] [2020-12-01 15:25:32,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:32,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:25:32,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547453389] [2020-12-01 15:25:32,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:25:32,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:25:32,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:25:32,036 INFO L87 Difference]: Start difference. First operand 954 states and 2536 transitions. Second operand 6 states. [2020-12-01 15:25:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:32,142 INFO L93 Difference]: Finished difference Result 829 states and 2154 transitions. [2020-12-01 15:25:32,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:25:32,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-01 15:25:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:32,145 INFO L225 Difference]: With dead ends: 829 [2020-12-01 15:25:32,145 INFO L226 Difference]: Without dead ends: 638 [2020-12-01 15:25:32,146 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-12-01 15:25:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2020-12-01 15:25:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2020-12-01 15:25:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2020-12-01 15:25:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1634 transitions. [2020-12-01 15:25:32,166 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1634 transitions. Word has length 21 [2020-12-01 15:25:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:32,167 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 1634 transitions. [2020-12-01 15:25:32,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:25:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1634 transitions. [2020-12-01 15:25:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:25:32,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:32,171 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-12-01 15:25:32,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:25:32,171 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 481327700, now seen corresponding path program 1 times [2020-12-01 15:25:32,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:32,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666194564] [2020-12-01 15:25:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:32,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666194564] [2020-12-01 15:25:32,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:32,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:25:32,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349125191] [2020-12-01 15:25:32,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:25:32,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:25:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:25:32,339 INFO L87 Difference]: Start difference. First operand 638 states and 1634 transitions. Second operand 7 states. [2020-12-01 15:25:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:32,599 INFO L93 Difference]: Finished difference Result 935 states and 2339 transitions. [2020-12-01 15:25:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:25:32,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 15:25:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:32,603 INFO L225 Difference]: With dead ends: 935 [2020-12-01 15:25:32,604 INFO L226 Difference]: Without dead ends: 724 [2020-12-01 15:25:32,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-01 15:25:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2020-12-01 15:25:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2020-12-01 15:25:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2020-12-01 15:25:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1823 transitions. [2020-12-01 15:25:32,630 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1823 transitions. Word has length 24 [2020-12-01 15:25:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:32,631 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1823 transitions. [2020-12-01 15:25:32,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:25:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1823 transitions. [2020-12-01 15:25:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:25:32,633 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:32,634 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-12-01 15:25:32,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:25:32,634 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1487437972, now seen corresponding path program 2 times [2020-12-01 15:25:32,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:32,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186493024] [2020-12-01 15:25:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:32,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186493024] [2020-12-01 15:25:32,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:32,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:25:32,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219726231] [2020-12-01 15:25:32,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:25:32,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:25:32,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:25:32,780 INFO L87 Difference]: Start difference. First operand 724 states and 1823 transitions. Second operand 7 states. [2020-12-01 15:25:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:33,013 INFO L93 Difference]: Finished difference Result 955 states and 2338 transitions. [2020-12-01 15:25:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:25:33,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 15:25:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:33,017 INFO L225 Difference]: With dead ends: 955 [2020-12-01 15:25:33,018 INFO L226 Difference]: Without dead ends: 790 [2020-12-01 15:25:33,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:25:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2020-12-01 15:25:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 668. [2020-12-01 15:25:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2020-12-01 15:25:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1643 transitions. [2020-12-01 15:25:33,050 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1643 transitions. Word has length 24 [2020-12-01 15:25:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:33,051 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 1643 transitions. [2020-12-01 15:25:33,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:25:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1643 transitions. [2020-12-01 15:25:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:25:33,054 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:33,054 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-12-01 15:25:33,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:25:33,055 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2083782188, now seen corresponding path program 3 times [2020-12-01 15:25:33,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:33,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14781154] [2020-12-01 15:25:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:33,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14781154] [2020-12-01 15:25:33,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:33,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:25:33,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534920641] [2020-12-01 15:25:33,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:25:33,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:25:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:25:33,167 INFO L87 Difference]: Start difference. First operand 668 states and 1643 transitions. Second operand 7 states. [2020-12-01 15:25:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:33,294 INFO L93 Difference]: Finished difference Result 637 states and 1579 transitions. [2020-12-01 15:25:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:25:33,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 15:25:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:33,298 INFO L225 Difference]: With dead ends: 637 [2020-12-01 15:25:33,299 INFO L226 Difference]: Without dead ends: 207 [2020-12-01 15:25:33,302 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-12-01 15:25:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-01 15:25:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-12-01 15:25:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-01 15:25:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 481 transitions. [2020-12-01 15:25:33,311 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 481 transitions. Word has length 24 [2020-12-01 15:25:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:33,313 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 481 transitions. [2020-12-01 15:25:33,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:25:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 481 transitions. [2020-12-01 15:25:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 15:25:33,314 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:33,314 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-12-01 15:25:33,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:25:33,315 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:33,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1904004510, now seen corresponding path program 1 times [2020-12-01 15:25:33,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:33,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172379295] [2020-12-01 15:25:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:33,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172379295] [2020-12-01 15:25:33,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:33,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:25:33,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916270663] [2020-12-01 15:25:33,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:25:33,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:25:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:25:33,499 INFO L87 Difference]: Start difference. First operand 207 states and 481 transitions. Second operand 7 states. [2020-12-01 15:25:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:33,596 INFO L93 Difference]: Finished difference Result 301 states and 703 transitions. [2020-12-01 15:25:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:25:33,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-01 15:25:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:33,598 INFO L225 Difference]: With dead ends: 301 [2020-12-01 15:25:33,598 INFO L226 Difference]: Without dead ends: 132 [2020-12-01 15:25:33,599 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-12-01 15:25:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-12-01 15:25:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-12-01 15:25:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-12-01 15:25:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 292 transitions. [2020-12-01 15:25:33,606 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 292 transitions. Word has length 27 [2020-12-01 15:25:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:33,606 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 292 transitions. [2020-12-01 15:25:33,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:25:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 292 transitions. [2020-12-01 15:25:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 15:25:33,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:33,607 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-12-01 15:25:33,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:25:33,608 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 358358878, now seen corresponding path program 2 times [2020-12-01 15:25:33,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:33,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202160331] [2020-12-01 15:25:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:25:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:25:33,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202160331] [2020-12-01 15:25:33,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:25:33,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:25:33,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338516726] [2020-12-01 15:25:33,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:25:33,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:25:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:25:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:25:33,766 INFO L87 Difference]: Start difference. First operand 132 states and 292 transitions. Second operand 7 states. [2020-12-01 15:25:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:25:33,853 INFO L93 Difference]: Finished difference Result 159 states and 347 transitions. [2020-12-01 15:25:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:25:33,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-01 15:25:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:25:33,855 INFO L225 Difference]: With dead ends: 159 [2020-12-01 15:25:33,855 INFO L226 Difference]: Without dead ends: 65 [2020-12-01 15:25:33,856 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-12-01 15:25:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-01 15:25:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-12-01 15:25:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-01 15:25:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-12-01 15:25:33,859 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-12-01 15:25:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:25:33,860 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-12-01 15:25:33,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:25:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-12-01 15:25:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-01 15:25:33,860 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:25:33,861 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-12-01 15:25:33,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:25:33,861 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:25:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:25:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 773461534, now seen corresponding path program 3 times [2020-12-01 15:25:33,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:25:33,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340437974] [2020-12-01 15:25:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:25:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:25:33,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:25:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:25:33,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:25:34,053 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:25:34,055 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:25:34,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:25:34,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:25:34 BasicIcfg [2020-12-01 15:25:34,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:25:34,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:25:34,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:25:34,246 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:25:34,247 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:25:08" (3/4) ... [2020-12-01 15:25:34,249 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:25:34,396 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cafc303a-9086-4bb9-beb4-3805c95edb23/bin/uautomizer/witness.graphml [2020-12-01 15:25:34,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:25:34,398 INFO L168 Benchmark]: Toolchain (without parser) took 29526.43 ms. Allocated memory was 90.2 MB in the beginning and 436.2 MB in the end (delta: 346.0 MB). Free memory was 57.3 MB in the beginning and 225.1 MB in the end (delta: -167.8 MB). Peak memory consumption was 178.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,400 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 90.2 MB. Free memory was 49.7 MB in the beginning and 49.7 MB in the end (delta: 30.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:25:34,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.22 ms. Allocated memory is still 90.2 MB. Free memory was 57.1 MB in the beginning and 44.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 90.2 MB. Free memory was 44.1 MB in the beginning and 40.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,402 INFO L168 Benchmark]: Boogie Preprocessor took 76.48 ms. Allocated memory is still 90.2 MB. Free memory was 40.9 MB in the beginning and 38.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,403 INFO L168 Benchmark]: RCFGBuilder took 2194.87 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 38.8 MB in the beginning and 115.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,403 INFO L168 Benchmark]: TraceAbstraction took 26235.66 ms. Allocated memory was 144.7 MB in the beginning and 436.2 MB in the end (delta: 291.5 MB). Free memory was 115.8 MB in the beginning and 243.9 MB in the end (delta: -128.2 MB). Peak memory consumption was 164.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,404 INFO L168 Benchmark]: Witness Printer took 151.39 ms. Allocated memory is still 436.2 MB. Free memory was 243.9 MB in the beginning and 225.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-01 15:25:34,408 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.42 ms. Allocated memory is still 90.2 MB. Free memory was 49.7 MB in the beginning and 49.7 MB in the end (delta: 30.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 791.22 ms. Allocated memory is still 90.2 MB. Free memory was 57.1 MB in the beginning and 44.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.59 ms. Allocated memory is still 90.2 MB. Free memory was 44.1 MB in the beginning and 40.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.48 ms. Allocated memory is still 90.2 MB. Free memory was 40.9 MB in the beginning and 38.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2194.87 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 38.8 MB in the beginning and 115.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26235.66 ms. Allocated memory was 144.7 MB in the beginning and 436.2 MB in the end (delta: 291.5 MB). Free memory was 115.8 MB in the beginning and 243.9 MB in the end (delta: -128.2 MB). Peak memory consumption was 164.4 MB. Max. memory is 16.1 GB. * Witness Printer took 151.39 ms. Allocated memory is still 436.2 MB. Free memory was 243.9 MB in the beginning and 225.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1890 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.8s, 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 t1277; [L845] FCALL, FORK 0 pthread_create(&t1277, ((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 t1278; [L847] FCALL, FORK 0 pthread_create(&t1278, ((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 t1279; [L849] FCALL, FORK 0 pthread_create(&t1279, ((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 t1280; [L851] FCALL, FORK 0 pthread_create(&t1280, ((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 FALSE 4 !(!expression) [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] 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] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [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] 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] 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_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [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] 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_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [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 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_tso.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=0, 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: 25.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.2s, HoareTripleCheckerStatistics: 689 SDtfs, 1015 SDslu, 1591 SDs, 0 SdLazy, 496 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 764 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 353 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 38104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...