./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 828219f335bdf28f6feb9ae7244acc963fe23587 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 07:40:06,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:40:06,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:40:06,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:40:06,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:40:06,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:40:06,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:40:06,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:40:06,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:40:06,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:40:06,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:40:06,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:40:06,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:40:06,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:40:06,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:40:06,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:40:06,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:40:06,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:40:06,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:40:06,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:40:06,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:40:06,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:40:06,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:40:06,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:40:06,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:40:06,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:40:06,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:40:06,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:40:06,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:40:06,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:40:06,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:40:06,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:40:06,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:40:06,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:40:06,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:40:06,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:40:06,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:40:06,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:40:06,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:40:06,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:40:06,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:40:06,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:40:06,537 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:40:06,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:40:06,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:40:06,538 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:40:06,539 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:40:06,542 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:40:06,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:40:06,542 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:40:06,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:40:06,543 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:40:06,543 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:40:06,543 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:40:06,544 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:40:06,544 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:40:06,544 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:40:06,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:40:06,546 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:40:06,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:40:06,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:40:06,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:40:06,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:40:06,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:40:06,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:40:06,549 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:40:06,549 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:40:06,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:40:06,549 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:40:06,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:40:06,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:40:06,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:40:06,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:40:06,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:40:06,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:40:06,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:40:06,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:40:06,553 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:40:06,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:40:06,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:40:06,554 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:40:06,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:40:06,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/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_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 828219f335bdf28f6feb9ae7244acc963fe23587 [2020-11-28 07:40:06,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:40:06,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:40:06,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:40:06,909 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:40:06,912 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:40:06,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i [2020-11-28 07:40:07,007 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/data/6d11be042/2fa0b4315c7040a5ae99ea63e8c444ab/FLAG0adff878c [2020-11-28 07:40:07,599 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:40:07,599 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/sv-benchmarks/c/pthread-wmm/mix047_pso.opt.i [2020-11-28 07:40:07,616 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/data/6d11be042/2fa0b4315c7040a5ae99ea63e8c444ab/FLAG0adff878c [2020-11-28 07:40:07,874 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/data/6d11be042/2fa0b4315c7040a5ae99ea63e8c444ab [2020-11-28 07:40:07,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:40:07,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:40:07,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:40:07,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:40:07,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:40:07,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:40:07" (1/1) ... [2020-11-28 07:40:07,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce5d7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:07, skipping insertion in model container [2020-11-28 07:40:07,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:40:07" (1/1) ... [2020-11-28 07:40:07,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:40:07,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:40:08,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:40:08,393 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:40:08,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:40:08,537 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:40:08,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08 WrapperNode [2020-11-28 07:40:08,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:40:08,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:40:08,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:40:08,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:40:08,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:40:08,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:40:08,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:40:08,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:40:08,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... [2020-11-28 07:40:08,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:40:08,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:40:08,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:40:08,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:40:08,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:40:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:40:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:40:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:40:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:40:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:40:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:40:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:40:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:40:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:40:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:40:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 07:40:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 07:40:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:40:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:40:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:40:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:40:08,739 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:40:11,879 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:40:11,880 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:40:11,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:11 BoogieIcfgContainer [2020-11-28 07:40:11,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:40:11,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:40:11,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:40:11,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:40:11,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:40:07" (1/3) ... [2020-11-28 07:40:11,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6358d709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:40:11, skipping insertion in model container [2020-11-28 07:40:11,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:40:08" (2/3) ... [2020-11-28 07:40:11,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6358d709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:40:11, skipping insertion in model container [2020-11-28 07:40:11,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:11" (3/3) ... [2020-11-28 07:40:11,890 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2020-11-28 07:40:11,901 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:40:11,901 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:40:11,905 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:40:11,906 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:40:11,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,958 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,962 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,976 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,977 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,979 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,989 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:40:11,991 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:40:12,002 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 07:40:12,035 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:40:12,035 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:40:12,035 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:40:12,035 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:40:12,035 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:40:12,036 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:40:12,036 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:40:12,036 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:40:12,048 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:40:12,051 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 07:40:12,053 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-28 07:40:12,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-28 07:40:12,137 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-28 07:40:12,137 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:40:12,142 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 07:40:12,150 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-28 07:40:12,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:12,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:12,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:12,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:12,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:13,275 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-28 07:40:13,599 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-28 07:40:13,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:13,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:13,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:13,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:13,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:13,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:13,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:13,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:13,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:13,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:40:13,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:40:14,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:40:14,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:14,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:14,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:14,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:14,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:15,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:15,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:15,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:15,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:40:15,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:15,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 07:40:15,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:15,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:15,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:15,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:15,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:15,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:15,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:15,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,030 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-11-28 07:40:16,175 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-28 07:40:16,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 07:40:16,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:16,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:40:16,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:40:16,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:40:16,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 07:40:16,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:16,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:16,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,563 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 232 DAG size of output: 191 [2020-11-28 07:40:17,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-28 07:40:17,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:17,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 07:40:17,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,512 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2020-11-28 07:40:18,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:18,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:18,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 07:40:18,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:18,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:18,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:18,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:18,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:18,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:18,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:18,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:18,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:18,992 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-11-28 07:40:19,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:19,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 07:40:19,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:19,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 07:40:19,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-11-28 07:40:19,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:40:19,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-28 07:40:19,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:19,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:40:19,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-28 07:40:19,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:40:20,222 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-28 07:40:20,359 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-28 07:40:20,935 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 07:40:21,178 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 07:40:21,184 INFO L131 LiptonReduction]: Checked pairs total: 7608 [2020-11-28 07:40:21,185 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-28 07:40:21,190 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-28 07:40:21,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-28 07:40:21,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-28 07:40:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:40:21,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:21,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:21,491 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -634987665, now seen corresponding path program 1 times [2020-11-28 07:40:21,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:21,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465954405] [2020-11-28 07:40:21,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:21,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465954405] [2020-11-28 07:40:21,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:21,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:40:21,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258134907] [2020-11-28 07:40:21,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:40:21,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:21,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:40:21,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:40:21,860 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-28 07:40:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:22,015 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-28 07:40:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:40:22,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 07:40:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:22,078 INFO L225 Difference]: With dead ends: 3082 [2020-11-28 07:40:22,078 INFO L226 Difference]: Without dead ends: 2602 [2020-11-28 07:40:22,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:40:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-28 07:40:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-28 07:40:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-28 07:40:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-28 07:40:22,265 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-28 07:40:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:22,266 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-28 07:40:22,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:40:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-28 07:40:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 07:40:22,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:22,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:22,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:40:22,271 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1880009126, now seen corresponding path program 1 times [2020-11-28 07:40:22,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:22,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131518084] [2020-11-28 07:40:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:22,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131518084] [2020-11-28 07:40:22,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:22,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:22,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965423118] [2020-11-28 07:40:22,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:22,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:22,488 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-11-28 07:40:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:22,658 INFO L93 Difference]: Finished difference Result 3062 states and 11482 transitions. [2020-11-28 07:40:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:22,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-28 07:40:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:22,688 INFO L225 Difference]: With dead ends: 3062 [2020-11-28 07:40:22,688 INFO L226 Difference]: Without dead ends: 2582 [2020-11-28 07:40:22,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-11-28 07:40:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-11-28 07:40:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-11-28 07:40:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9968 transitions. [2020-11-28 07:40:22,868 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9968 transitions. Word has length 12 [2020-11-28 07:40:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:22,869 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9968 transitions. [2020-11-28 07:40:22,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9968 transitions. [2020-11-28 07:40:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:40:22,875 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:22,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:22,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:40:22,876 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1832422551, now seen corresponding path program 1 times [2020-11-28 07:40:22,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:22,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934313495] [2020-11-28 07:40:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:22,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934313495] [2020-11-28 07:40:22,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:22,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:22,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478004339] [2020-11-28 07:40:22,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:22,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:22,985 INFO L87 Difference]: Start difference. First operand 2582 states and 9968 transitions. Second operand 4 states. [2020-11-28 07:40:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:23,044 INFO L93 Difference]: Finished difference Result 2752 states and 10304 transitions. [2020-11-28 07:40:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:23,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 07:40:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:23,069 INFO L225 Difference]: With dead ends: 2752 [2020-11-28 07:40:23,069 INFO L226 Difference]: Without dead ends: 2282 [2020-11-28 07:40:23,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-11-28 07:40:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-11-28 07:40:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-11-28 07:40:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-11-28 07:40:23,164 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-11-28 07:40:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:23,165 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-11-28 07:40:23,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-11-28 07:40:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:40:23,168 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:23,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:23,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:40:23,168 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 970458918, now seen corresponding path program 1 times [2020-11-28 07:40:23,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:23,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129531300] [2020-11-28 07:40:23,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:23,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129531300] [2020-11-28 07:40:23,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:23,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:23,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827938571] [2020-11-28 07:40:23,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:23,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:23,291 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 4 states. [2020-11-28 07:40:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:23,361 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2020-11-28 07:40:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:23,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 07:40:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:23,383 INFO L225 Difference]: With dead ends: 2538 [2020-11-28 07:40:23,384 INFO L226 Difference]: Without dead ends: 2218 [2020-11-28 07:40:23,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-11-28 07:40:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-11-28 07:40:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-11-28 07:40:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-11-28 07:40:23,471 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2020-11-28 07:40:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:23,471 INFO L481 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-11-28 07:40:23,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-11-28 07:40:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:40:23,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:23,475 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:23,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:40:23,475 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash -40609003, now seen corresponding path program 1 times [2020-11-28 07:40:23,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:23,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205469365] [2020-11-28 07:40:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:23,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205469365] [2020-11-28 07:40:23,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:23,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:40:23,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660049384] [2020-11-28 07:40:23,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:23,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:23,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:23,650 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-11-28 07:40:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:23,712 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-11-28 07:40:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:23,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-28 07:40:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:23,733 INFO L225 Difference]: With dead ends: 2410 [2020-11-28 07:40:23,734 INFO L226 Difference]: Without dead ends: 2154 [2020-11-28 07:40:23,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-11-28 07:40:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-11-28 07:40:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-11-28 07:40:23,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-11-28 07:40:23,813 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-11-28 07:40:23,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:23,813 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-11-28 07:40:23,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-11-28 07:40:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 07:40:23,818 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:23,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:23,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:40:23,818 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:23,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1258925188, now seen corresponding path program 1 times [2020-11-28 07:40:23,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:23,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379590466] [2020-11-28 07:40:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:23,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379590466] [2020-11-28 07:40:23,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:23,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:23,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574731082] [2020-11-28 07:40:23,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:23,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:23,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:23,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:23,953 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 5 states. [2020-11-28 07:40:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:24,145 INFO L93 Difference]: Finished difference Result 2322 states and 8524 transitions. [2020-11-28 07:40:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:40:24,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-28 07:40:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:24,166 INFO L225 Difference]: With dead ends: 2322 [2020-11-28 07:40:24,166 INFO L226 Difference]: Without dead ends: 2066 [2020-11-28 07:40:24,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-11-28 07:40:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2020-11-28 07:40:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-11-28 07:40:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 7728 transitions. [2020-11-28 07:40:24,270 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 7728 transitions. Word has length 16 [2020-11-28 07:40:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:24,271 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 7728 transitions. [2020-11-28 07:40:24,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 7728 transitions. [2020-11-28 07:40:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 07:40:24,276 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:24,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:24,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:40:24,277 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1060358638, now seen corresponding path program 1 times [2020-11-28 07:40:24,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:24,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939640219] [2020-11-28 07:40:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:24,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-11-28 07:40:24,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939640219] [2020-11-28 07:40:24,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:24,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:40:24,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354726386] [2020-11-28 07:40:24,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 07:40:24,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 07:40:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:24,474 INFO L87 Difference]: Start difference. First operand 2066 states and 7728 transitions. Second operand 7 states. [2020-11-28 07:40:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:24,670 INFO L93 Difference]: Finished difference Result 2358 states and 8640 transitions. [2020-11-28 07:40:24,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:40:24,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 07:40:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:24,682 INFO L225 Difference]: With dead ends: 2358 [2020-11-28 07:40:24,682 INFO L226 Difference]: Without dead ends: 2162 [2020-11-28 07:40:24,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:40:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-11-28 07:40:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2106. [2020-11-28 07:40:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-11-28 07:40:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7832 transitions. [2020-11-28 07:40:24,757 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7832 transitions. Word has length 17 [2020-11-28 07:40:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:24,758 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7832 transitions. [2020-11-28 07:40:24,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 07:40:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7832 transitions. [2020-11-28 07:40:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:40:24,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:24,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:24,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:40:24,764 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash -27657637, now seen corresponding path program 1 times [2020-11-28 07:40:24,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:24,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638144055] [2020-11-28 07:40:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:25,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638144055] [2020-11-28 07:40:25,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:25,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:40:25,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409603470] [2020-11-28 07:40:25,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 07:40:25,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 07:40:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 07:40:25,022 INFO L87 Difference]: Start difference. First operand 2106 states and 7832 transitions. Second operand 8 states. [2020-11-28 07:40:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:25,308 INFO L93 Difference]: Finished difference Result 2522 states and 9068 transitions. [2020-11-28 07:40:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:40:25,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-28 07:40:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:25,320 INFO L225 Difference]: With dead ends: 2522 [2020-11-28 07:40:25,320 INFO L226 Difference]: Without dead ends: 2066 [2020-11-28 07:40:25,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-28 07:40:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2020-11-28 07:40:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1898. [2020-11-28 07:40:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-28 07:40:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6944 transitions. [2020-11-28 07:40:25,406 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6944 transitions. Word has length 18 [2020-11-28 07:40:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:25,407 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6944 transitions. [2020-11-28 07:40:25,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 07:40:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6944 transitions. [2020-11-28 07:40:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:40:25,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:25,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:25,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:40:25,416 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1306898107, now seen corresponding path program 1 times [2020-11-28 07:40:25,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:25,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138872117] [2020-11-28 07:40:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:25,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138872117] [2020-11-28 07:40:25,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:25,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:25,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925761675] [2020-11-28 07:40:25,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:25,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:25,527 INFO L87 Difference]: Start difference. First operand 1898 states and 6944 transitions. Second operand 4 states. [2020-11-28 07:40:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:25,573 INFO L93 Difference]: Finished difference Result 1970 states and 6574 transitions. [2020-11-28 07:40:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:40:25,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-28 07:40:25,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:25,580 INFO L225 Difference]: With dead ends: 1970 [2020-11-28 07:40:25,580 INFO L226 Difference]: Without dead ends: 1490 [2020-11-28 07:40:25,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-11-28 07:40:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-11-28 07:40:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-11-28 07:40:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4922 transitions. [2020-11-28 07:40:25,637 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4922 transitions. Word has length 18 [2020-11-28 07:40:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:25,638 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4922 transitions. [2020-11-28 07:40:25,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4922 transitions. [2020-11-28 07:40:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-28 07:40:25,643 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:25,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:25,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:40:25,643 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash -467514533, now seen corresponding path program 1 times [2020-11-28 07:40:25,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:25,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766380904] [2020-11-28 07:40:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:25,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766380904] [2020-11-28 07:40:25,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:25,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:40:25,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411001484] [2020-11-28 07:40:25,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:25,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:25,733 INFO L87 Difference]: Start difference. First operand 1490 states and 4922 transitions. Second operand 5 states. [2020-11-28 07:40:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:25,828 INFO L93 Difference]: Finished difference Result 1282 states and 3882 transitions. [2020-11-28 07:40:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:25,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-11-28 07:40:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:25,833 INFO L225 Difference]: With dead ends: 1282 [2020-11-28 07:40:25,833 INFO L226 Difference]: Without dead ends: 982 [2020-11-28 07:40:25,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2020-11-28 07:40:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2020-11-28 07:40:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-11-28 07:40:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 2920 transitions. [2020-11-28 07:40:25,861 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 2920 transitions. Word has length 19 [2020-11-28 07:40:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:25,861 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 2920 transitions. [2020-11-28 07:40:25,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 2920 transitions. [2020-11-28 07:40:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 07:40:25,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:25,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:25,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:40:25,865 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1857918314, now seen corresponding path program 1 times [2020-11-28 07:40:25,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:25,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380177855] [2020-11-28 07:40:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:25,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380177855] [2020-11-28 07:40:25,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:25,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:40:25,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994162707] [2020-11-28 07:40:25,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:40:25,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:40:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:40:25,942 INFO L87 Difference]: Start difference. First operand 982 states and 2920 transitions. Second operand 4 states. [2020-11-28 07:40:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:25,991 INFO L93 Difference]: Finished difference Result 1445 states and 4142 transitions. [2020-11-28 07:40:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:25,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-28 07:40:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:25,995 INFO L225 Difference]: With dead ends: 1445 [2020-11-28 07:40:25,995 INFO L226 Difference]: Without dead ends: 1002 [2020-11-28 07:40:25,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-11-28 07:40:26,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 970. [2020-11-28 07:40:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-11-28 07:40:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2734 transitions. [2020-11-28 07:40:26,023 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2734 transitions. Word has length 20 [2020-11-28 07:40:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:26,023 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 2734 transitions. [2020-11-28 07:40:26,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:40:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2734 transitions. [2020-11-28 07:40:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:26,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:26,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:26,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:40:26,027 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -21138615, now seen corresponding path program 1 times [2020-11-28 07:40:26,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:26,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749051425] [2020-11-28 07:40:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:26,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749051425] [2020-11-28 07:40:26,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:26,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 07:40:26,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135030008] [2020-11-28 07:40:26,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 07:40:26,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 07:40:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-28 07:40:26,289 INFO L87 Difference]: Start difference. First operand 970 states and 2734 transitions. Second operand 11 states. [2020-11-28 07:40:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:26,754 INFO L93 Difference]: Finished difference Result 1318 states and 3682 transitions. [2020-11-28 07:40:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-28 07:40:26,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-28 07:40:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:26,757 INFO L225 Difference]: With dead ends: 1318 [2020-11-28 07:40:26,757 INFO L226 Difference]: Without dead ends: 1068 [2020-11-28 07:40:26,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-28 07:40:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2020-11-28 07:40:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2020-11-28 07:40:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2020-11-28 07:40:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3027 transitions. [2020-11-28 07:40:26,799 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3027 transitions. Word has length 21 [2020-11-28 07:40:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:26,799 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 3027 transitions. [2020-11-28 07:40:26,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 07:40:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3027 transitions. [2020-11-28 07:40:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:26,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:26,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:26,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:40:26,803 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash 539223623, now seen corresponding path program 2 times [2020-11-28 07:40:26,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:26,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617750860] [2020-11-28 07:40:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:27,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617750860] [2020-11-28 07:40:27,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:27,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 07:40:27,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123544610] [2020-11-28 07:40:27,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 07:40:27,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 07:40:27,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:40:27,032 INFO L87 Difference]: Start difference. First operand 1068 states and 3027 transitions. Second operand 9 states. [2020-11-28 07:40:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:27,267 INFO L93 Difference]: Finished difference Result 1438 states and 3929 transitions. [2020-11-28 07:40:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:40:27,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-28 07:40:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:27,271 INFO L225 Difference]: With dead ends: 1438 [2020-11-28 07:40:27,272 INFO L226 Difference]: Without dead ends: 1025 [2020-11-28 07:40:27,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-28 07:40:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2020-11-28 07:40:27,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1010. [2020-11-28 07:40:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2020-11-28 07:40:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2803 transitions. [2020-11-28 07:40:27,302 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2803 transitions. Word has length 21 [2020-11-28 07:40:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:27,302 INFO L481 AbstractCegarLoop]: Abstraction has 1010 states and 2803 transitions. [2020-11-28 07:40:27,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 07:40:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2803 transitions. [2020-11-28 07:40:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:27,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:27,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:27,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:40:27,306 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254035, now seen corresponding path program 3 times [2020-11-28 07:40:27,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:27,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074548876] [2020-11-28 07:40:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:27,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074548876] [2020-11-28 07:40:27,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:27,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 07:40:27,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179337172] [2020-11-28 07:40:27,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 07:40:27,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:27,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 07:40:27,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-28 07:40:27,573 INFO L87 Difference]: Start difference. First operand 1010 states and 2803 transitions. Second operand 11 states. [2020-11-28 07:40:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:27,997 INFO L93 Difference]: Finished difference Result 1337 states and 3670 transitions. [2020-11-28 07:40:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-28 07:40:27,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-28 07:40:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,001 INFO L225 Difference]: With dead ends: 1337 [2020-11-28 07:40:28,001 INFO L226 Difference]: Without dead ends: 1087 [2020-11-28 07:40:28,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-28 07:40:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2020-11-28 07:40:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1066. [2020-11-28 07:40:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-11-28 07:40:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 2956 transitions. [2020-11-28 07:40:28,032 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 2956 transitions. Word has length 21 [2020-11-28 07:40:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,032 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 2956 transitions. [2020-11-28 07:40:28,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 07:40:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 2956 transitions. [2020-11-28 07:40:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:28,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 07:40:28,036 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash -814891797, now seen corresponding path program 4 times [2020-11-28 07:40:28,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583280622] [2020-11-28 07:40:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:28,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583280622] [2020-11-28 07:40:28,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 07:40:28,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356356717] [2020-11-28 07:40:28,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 07:40:28,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 07:40:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:40:28,241 INFO L87 Difference]: Start difference. First operand 1066 states and 2956 transitions. Second operand 9 states. [2020-11-28 07:40:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,441 INFO L93 Difference]: Finished difference Result 1462 states and 3920 transitions. [2020-11-28 07:40:28,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:40:28,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-28 07:40:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,447 INFO L225 Difference]: With dead ends: 1462 [2020-11-28 07:40:28,447 INFO L226 Difference]: Without dead ends: 1135 [2020-11-28 07:40:28,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-28 07:40:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2020-11-28 07:40:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 946. [2020-11-28 07:40:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2020-11-28 07:40:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2573 transitions. [2020-11-28 07:40:28,485 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2573 transitions. Word has length 21 [2020-11-28 07:40:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,486 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 2573 transitions. [2020-11-28 07:40:28,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 07:40:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2573 transitions. [2020-11-28 07:40:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:28,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 07:40:28,490 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1080202451, now seen corresponding path program 5 times [2020-11-28 07:40:28,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541394195] [2020-11-28 07:40:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:28,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541394195] [2020-11-28 07:40:28,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:40:28,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334523177] [2020-11-28 07:40:28,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:40:28,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:40:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:28,594 INFO L87 Difference]: Start difference. First operand 946 states and 2573 transitions. Second operand 6 states. [2020-11-28 07:40:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:28,772 INFO L93 Difference]: Finished difference Result 1365 states and 3564 transitions. [2020-11-28 07:40:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 07:40:28,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 07:40:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:28,775 INFO L225 Difference]: With dead ends: 1365 [2020-11-28 07:40:28,775 INFO L226 Difference]: Without dead ends: 958 [2020-11-28 07:40:28,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-28 07:40:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2020-11-28 07:40:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 930. [2020-11-28 07:40:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-11-28 07:40:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2386 transitions. [2020-11-28 07:40:28,799 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2386 transitions. Word has length 21 [2020-11-28 07:40:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:28,800 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 2386 transitions. [2020-11-28 07:40:28,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:40:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2386 transitions. [2020-11-28 07:40:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:40:28,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:28,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:28,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 07:40:28,803 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -652683463, now seen corresponding path program 1 times [2020-11-28 07:40:28,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:28,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856517786] [2020-11-28 07:40:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:28,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856517786] [2020-11-28 07:40:28,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:28,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:40:28,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540064967] [2020-11-28 07:40:28,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:40:28,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:40:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:40:28,908 INFO L87 Difference]: Start difference. First operand 930 states and 2386 transitions. Second operand 6 states. [2020-11-28 07:40:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,023 INFO L93 Difference]: Finished difference Result 805 states and 2011 transitions. [2020-11-28 07:40:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:40:29,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-28 07:40:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,026 INFO L225 Difference]: With dead ends: 805 [2020-11-28 07:40:29,026 INFO L226 Difference]: Without dead ends: 616 [2020-11-28 07:40:29,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 07:40:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-11-28 07:40:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2020-11-28 07:40:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2020-11-28 07:40:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1509 transitions. [2020-11-28 07:40:29,052 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1509 transitions. Word has length 21 [2020-11-28 07:40:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,052 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 1509 transitions. [2020-11-28 07:40:29,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:40:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1509 transitions. [2020-11-28 07:40:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 07:40:29,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 07:40:29,055 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2083782188, now seen corresponding path program 1 times [2020-11-28 07:40:29,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899303625] [2020-11-28 07:40:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:29,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-11-28 07:40:29,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899303625] [2020-11-28 07:40:29,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:29,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 07:40:29,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994674617] [2020-11-28 07:40:29,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 07:40:29,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:29,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 07:40:29,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:29,166 INFO L87 Difference]: Start difference. First operand 616 states and 1509 transitions. Second operand 7 states. [2020-11-28 07:40:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,290 INFO L93 Difference]: Finished difference Result 585 states and 1448 transitions. [2020-11-28 07:40:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:40:29,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-28 07:40:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,291 INFO L225 Difference]: With dead ends: 585 [2020-11-28 07:40:29,291 INFO L226 Difference]: Without dead ends: 207 [2020-11-28 07:40:29,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-28 07:40:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-28 07:40:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-11-28 07:40:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-11-28 07:40:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 481 transitions. [2020-11-28 07:40:29,297 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 481 transitions. Word has length 24 [2020-11-28 07:40:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,297 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 481 transitions. [2020-11-28 07:40:29,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 07:40:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 481 transitions. [2020-11-28 07:40:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 07:40:29,298 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 07:40:29,298 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1904004510, now seen corresponding path program 1 times [2020-11-28 07:40:29,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136298004] [2020-11-28 07:40:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:40:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:40:29,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136298004] [2020-11-28 07:40:29,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:40:29,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:40:29,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392672041] [2020-11-28 07:40:29,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:40:29,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:40:29,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:40:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:40:29,369 INFO L87 Difference]: Start difference. First operand 207 states and 481 transitions. Second operand 5 states. [2020-11-28 07:40:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:40:29,423 INFO L93 Difference]: Finished difference Result 234 states and 536 transitions. [2020-11-28 07:40:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:40:29,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-11-28 07:40:29,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:40:29,424 INFO L225 Difference]: With dead ends: 234 [2020-11-28 07:40:29,424 INFO L226 Difference]: Without dead ends: 65 [2020-11-28 07:40:29,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:40:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-28 07:40:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-28 07:40:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-28 07:40:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-11-28 07:40:29,426 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2020-11-28 07:40:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:40:29,426 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-11-28 07:40:29,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:40:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-11-28 07:40:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 07:40:29,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:40:29,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:40:29,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 07:40:29,427 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:40:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:40:29,428 INFO L82 PathProgramCache]: Analyzing trace with hash 773461534, now seen corresponding path program 2 times [2020-11-28 07:40:29,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:40:29,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930325977] [2020-11-28 07:40:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:40:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:40:29,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:40:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:40:29,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:40:29,587 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:40:29,587 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:40:29,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 07:40:29,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,616 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,616 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,617 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 07:40:29,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:40:29 BasicIcfg [2020-11-28 07:40:29,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:40:29,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:40:29,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:40:29,760 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:40:29,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:40:11" (3/4) ... [2020-11-28 07:40:29,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:40:29,776 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,781 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 07:40:29,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:40:29,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:40:29,929 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3723d3f8-0e62-453b-b11d-3f61686a1de3/bin/utaipan/witness.graphml [2020-11-28 07:40:29,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:40:29,930 INFO L168 Benchmark]: Toolchain (without parser) took 22052.24 ms. Allocated memory was 104.9 MB in the beginning and 373.3 MB in the end (delta: 268.4 MB). Free memory was 70.3 MB in the beginning and 179.2 MB in the end (delta: -108.9 MB). Peak memory consumption was 159.5 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,930 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 71.3 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:40:29,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.24 ms. Allocated memory is still 104.9 MB. Free memory was 70.1 MB in the beginning and 56.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.34 ms. Allocated memory is still 104.9 MB. Free memory was 56.0 MB in the beginning and 53.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,931 INFO L168 Benchmark]: Boogie Preprocessor took 42.57 ms. Allocated memory is still 104.9 MB. Free memory was 53.4 MB in the beginning and 50.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,932 INFO L168 Benchmark]: RCFGBuilder took 3240.07 ms. Allocated memory was 104.9 MB in the beginning and 140.5 MB in the end (delta: 35.7 MB). Free memory was 50.8 MB in the beginning and 76.6 MB in the end (delta: -25.8 MB). Peak memory consumption was 57.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,932 INFO L168 Benchmark]: TraceAbstraction took 17875.13 ms. Allocated memory was 140.5 MB in the beginning and 373.3 MB in the end (delta: 232.8 MB). Free memory was 76.6 MB in the beginning and 200.2 MB in the end (delta: -123.6 MB). Peak memory consumption was 110.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,933 INFO L168 Benchmark]: Witness Printer took 169.73 ms. Allocated memory is still 373.3 MB. Free memory was 200.2 MB in the beginning and 179.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 07:40:29,935 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.17 ms. Allocated memory is still 71.3 MB. Free memory was 28.9 MB in the beginning and 28.8 MB in the end (delta: 39.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 656.24 ms. Allocated memory is still 104.9 MB. Free memory was 70.1 MB in the beginning and 56.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.34 ms. Allocated memory is still 104.9 MB. Free memory was 56.0 MB in the beginning and 53.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.57 ms. Allocated memory is still 104.9 MB. Free memory was 53.4 MB in the beginning and 50.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3240.07 ms. Allocated memory was 104.9 MB in the beginning and 140.5 MB in the end (delta: 35.7 MB). Free memory was 50.8 MB in the beginning and 76.6 MB in the end (delta: -25.8 MB). Peak memory consumption was 57.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17875.13 ms. Allocated memory was 140.5 MB in the beginning and 373.3 MB in the end (delta: 232.8 MB). Free memory was 76.6 MB in the beginning and 200.2 MB in the end (delta: -123.6 MB). Peak memory consumption was 110.2 MB. Max. memory is 16.1 GB. * Witness Printer took 169.73 ms. Allocated memory is still 373.3 MB. Free memory was 200.2 MB in the beginning and 179.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1891 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.1s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7608 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1261; [L845] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1262; [L847] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1263; [L849] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1264; [L851] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix047_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 779 SDtfs, 1179 SDslu, 1909 SDs, 0 SdLazy, 914 SolverSat, 247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 509 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 33446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...