./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.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_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/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 2d0efb2b7db857c130817c46f142aefdb6cc0e00 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:37:58,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:37:58,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:37:58,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:37:58,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:37:58,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:37:58,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:37:58,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:37:58,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:37:58,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:37:58,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:37:58,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:37:58,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:37:58,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:37:58,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:37:58,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:37:58,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:37:58,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:37:58,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:37:58,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:37:58,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:37:58,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:37:58,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:37:58,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:37:58,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:37:58,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:37:58,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:37:58,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:37:58,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:37:58,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:37:58,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:37:58,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:37:58,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:37:58,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:37:58,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:37:58,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:37:58,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:37:58,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:37:58,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:37:58,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:37:58,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:37:58,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:37:58,825 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:37:58,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:37:58,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:37:58,827 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:37:58,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:37:58,827 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:37:58,827 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:37:58,827 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:37:58,828 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:37:58,828 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:37:58,829 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:37:58,829 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:37:58,830 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:37:58,830 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:37:58,830 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:37:58,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:37:58,831 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:37:58,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:37:58,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:37:58,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:37:58,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:37:58,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:37:58,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:37:58,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:37:58,833 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:37:58,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:37:58,833 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:37:58,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:37:58,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:37:58,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:37:58,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:37:58,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:37:58,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:37:58,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:37:58,836 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:37:58,837 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:37:58,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:37:58,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:37:58,837 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:37:58,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:37:58,838 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_c033184a-a383-43f5-93a9-cc47f0822949/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_c033184a-a383-43f5-93a9-cc47f0822949/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 -> 2d0efb2b7db857c130817c46f142aefdb6cc0e00 [2020-11-28 07:37:59,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:37:59,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:37:59,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:37:59,120 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:37:59,121 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:37:59,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-11-28 07:37:59,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/data/0742a8b6c/39f5ab2ee2984f89b0321823fe8f6fcd/FLAGda27fb882 [2020-11-28 07:37:59,795 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:37:59,796 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/sv-benchmarks/c/pthread-wmm/safe031_rmo.opt.i [2020-11-28 07:37:59,810 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/data/0742a8b6c/39f5ab2ee2984f89b0321823fe8f6fcd/FLAGda27fb882 [2020-11-28 07:38:00,066 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/data/0742a8b6c/39f5ab2ee2984f89b0321823fe8f6fcd [2020-11-28 07:38:00,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:38:00,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:38:00,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:38:00,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:38:00,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:38:00,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5f346d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00, skipping insertion in model container [2020-11-28 07:38:00,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:38:00,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:38:00,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:38:00,556 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:38:00,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:38:00,744 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:38:00,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00 WrapperNode [2020-11-28 07:38:00,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:38:00,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:38:00,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:38:00,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:38:00,754 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:38:00" (1/1) ... [2020-11-28 07:38:00,771 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:38:00" (1/1) ... [2020-11-28 07:38:00,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:38:00,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:38:00,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:38:00,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:38:00,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... [2020-11-28 07:38:00,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:38:00,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:38:00,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:38:00,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:38:00,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/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:38:00,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:38:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:38:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:38:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:38:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:38:00,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:38:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:38:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:38:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:38:00,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:38:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:38:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:38:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:38:00,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:38:00,967 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:38:03,460 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:38:03,460 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:38:03,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:38:03 BoogieIcfgContainer [2020-11-28 07:38:03,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:38:03,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:38:03,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:38:03,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:38:03,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:38:00" (1/3) ... [2020-11-28 07:38:03,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e793320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:38:03, skipping insertion in model container [2020-11-28 07:38:03,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:38:00" (2/3) ... [2020-11-28 07:38:03,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e793320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:38:03, skipping insertion in model container [2020-11-28 07:38:03,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:38:03" (3/3) ... [2020-11-28 07:38:03,472 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-11-28 07:38:03,483 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:38:03,483 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:38:03,488 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:38:03,489 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:38:03,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,538 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,545 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,546 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,555 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,556 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:38:03,561 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:38:03,572 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 07:38:03,606 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:38:03,606 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:38:03,606 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:38:03,607 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:38:03,607 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:38:03,607 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:38:03,607 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:38:03,607 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:38:03,623 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:38:03,626 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-28 07:38:03,632 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-28 07:38:03,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-28 07:38:03,695 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-28 07:38:03,695 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:38:03,701 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-28 07:38:03,707 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-28 07:38:03,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:03,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:03,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:03,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:03,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:03,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:03,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:03,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:04,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:04,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:38:04,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:38:04,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:04,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-28 07:38:04,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:04,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 07:38:04,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:04,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:38:04,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:38:04,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:04,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:04,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:04,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:04,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:04,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:04,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:04,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,359 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-28 07:38:05,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:38:05,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:05,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-28 07:38:05,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:05,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:05,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:05,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:05,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:05,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:05,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:05,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:05,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:05,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-28 07:38:05,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:38:05,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:05,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:38:05,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:38:05,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-28 07:38:05,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:38:05,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:05,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:05,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:05,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:38:05,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,504 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 07:38:06,609 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 07:38:06,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-28 07:38:06,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:06,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:06,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:06,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:06,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:38:06,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:38:06,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:38:06,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:06,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:06,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:06,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:06,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:38:06,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:06,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:38:07,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:07,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:07,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:07,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:07,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:07,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:38:07,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:07,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:38:07,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:07,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:07,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:07,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:38:07,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:38:07,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:07,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:38:07,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:07,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:07,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:07,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:07,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:07,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:38:07,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:07,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:07,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:08,511 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-28 07:38:08,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-28 07:38:08,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:08,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-28 07:38:08,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:38:09,361 WARN L193 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-28 07:38:10,486 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-28 07:38:10,725 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-28 07:38:11,262 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-11-28 07:38:11,505 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-28 07:38:11,621 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-11-28 07:38:12,651 WARN L193 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-11-28 07:38:12,962 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-11-28 07:38:13,311 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-11-28 07:38:13,426 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-28 07:38:13,824 WARN L193 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-28 07:38:13,997 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-28 07:38:14,017 INFO L131 LiptonReduction]: Checked pairs total: 4721 [2020-11-28 07:38:14,017 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-28 07:38:14,021 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-28 07:38:14,078 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-28 07:38:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-28 07:38:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 07:38:14,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:14,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:14,088 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:14,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-11-28 07:38:14,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:14,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862721403] [2020-11-28 07:38:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:14,395 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:38:14,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862721403] [2020-11-28 07:38:14,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:14,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:38:14,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080089515] [2020-11-28 07:38:14,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:38:14,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:14,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:38:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:38:14,417 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-28 07:38:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:14,573 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-28 07:38:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:38:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 07:38:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:14,608 INFO L225 Difference]: With dead ends: 550 [2020-11-28 07:38:14,611 INFO L226 Difference]: Without dead ends: 450 [2020-11-28 07:38:14,612 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:38:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-28 07:38:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-28 07:38:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-28 07:38:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-28 07:38:14,714 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-28 07:38:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:14,715 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-28 07:38:14,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:38:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-28 07:38:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:38:14,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:14,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:14,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:38:14,717 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:14,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-11-28 07:38:14,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:14,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392940043] [2020-11-28 07:38:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:14,897 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:38:14,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392940043] [2020-11-28 07:38:14,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:14,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:38:14,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938616373] [2020-11-28 07:38:14,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:38:14,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:38:14,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:38:14,900 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-28 07:38:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:14,944 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-11-28 07:38:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:38:14,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 07:38:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:14,955 INFO L225 Difference]: With dead ends: 445 [2020-11-28 07:38:14,955 INFO L226 Difference]: Without dead ends: 445 [2020-11-28 07:38:14,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:38:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-28 07:38:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-11-28 07:38:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-28 07:38:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-11-28 07:38:15,001 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-11-28 07:38:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:15,001 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-11-28 07:38:15,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:38:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-11-28 07:38:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:38:15,005 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:15,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:15,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:38:15,006 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash -537078437, now seen corresponding path program 1 times [2020-11-28 07:38:15,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:15,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200795192] [2020-11-28 07:38:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:15,147 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:38:15,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200795192] [2020-11-28 07:38:15,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:15,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:38:15,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796101604] [2020-11-28 07:38:15,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:38:15,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:15,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:38:15,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:15,149 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 4 states. [2020-11-28 07:38:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:15,198 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-11-28 07:38:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:38:15,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-28 07:38:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:15,204 INFO L225 Difference]: With dead ends: 440 [2020-11-28 07:38:15,204 INFO L226 Difference]: Without dead ends: 440 [2020-11-28 07:38:15,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-28 07:38:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-28 07:38:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-28 07:38:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-11-28 07:38:15,250 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2020-11-28 07:38:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:15,250 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-11-28 07:38:15,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:38:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-11-28 07:38:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 07:38:15,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:15,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:15,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:38:15,254 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-11-28 07:38:15,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:15,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806645964] [2020-11-28 07:38:15,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:15,393 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:38:15,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806645964] [2020-11-28 07:38:15,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:15,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:38:15,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351730971] [2020-11-28 07:38:15,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:38:15,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:38:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:15,395 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-11-28 07:38:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:15,442 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-11-28 07:38:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:38:15,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-28 07:38:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:15,447 INFO L225 Difference]: With dead ends: 434 [2020-11-28 07:38:15,447 INFO L226 Difference]: Without dead ends: 434 [2020-11-28 07:38:15,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-11-28 07:38:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-11-28 07:38:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-11-28 07:38:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-11-28 07:38:15,466 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-11-28 07:38:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:15,466 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-11-28 07:38:15,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:38:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-11-28 07:38:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:38:15,468 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:15,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:15,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:38:15,469 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-11-28 07:38:15,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:15,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109492154] [2020-11-28 07:38:15,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:15,559 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:38:15,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109492154] [2020-11-28 07:38:15,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:15,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:38:15,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909636795] [2020-11-28 07:38:15,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:38:15,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:15,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:38:15,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:15,562 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-11-28 07:38:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:15,692 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-11-28 07:38:15,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:38:15,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-28 07:38:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:15,698 INFO L225 Difference]: With dead ends: 599 [2020-11-28 07:38:15,698 INFO L226 Difference]: Without dead ends: 464 [2020-11-28 07:38:15,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:38:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-11-28 07:38:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-11-28 07:38:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-28 07:38:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-11-28 07:38:15,720 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-11-28 07:38:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:15,721 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-11-28 07:38:15,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:38:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-11-28 07:38:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:38:15,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:15,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:15,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:38:15,725 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-11-28 07:38:15,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:15,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163304930] [2020-11-28 07:38:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:15,930 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:38:15,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163304930] [2020-11-28 07:38:15,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:15,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:38:15,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727714857] [2020-11-28 07:38:15,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:38:15,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:38:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:15,932 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 5 states. [2020-11-28 07:38:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:16,019 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-11-28 07:38:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:38:16,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-28 07:38:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:16,024 INFO L225 Difference]: With dead ends: 407 [2020-11-28 07:38:16,024 INFO L226 Difference]: Without dead ends: 407 [2020-11-28 07:38:16,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-11-28 07:38:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-11-28 07:38:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-28 07:38:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-11-28 07:38:16,041 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-11-28 07:38:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:16,041 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-11-28 07:38:16,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:38:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-11-28 07:38:16,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 07:38:16,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:16,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:16,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:38:16,043 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-11-28 07:38:16,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:16,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408709703] [2020-11-28 07:38:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:16,139 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:38:16,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408709703] [2020-11-28 07:38:16,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:16,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:38:16,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904183271] [2020-11-28 07:38:16,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:38:16,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:16,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:38:16,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:16,141 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-11-28 07:38:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:16,233 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-11-28 07:38:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:38:16,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 07:38:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:16,239 INFO L225 Difference]: With dead ends: 402 [2020-11-28 07:38:16,239 INFO L226 Difference]: Without dead ends: 402 [2020-11-28 07:38:16,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-11-28 07:38:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-11-28 07:38:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-11-28 07:38:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-11-28 07:38:16,257 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-11-28 07:38:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:16,258 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-11-28 07:38:16,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:38:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-11-28 07:38:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:38:16,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:16,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:16,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:38:16,260 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-11-28 07:38:16,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:16,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106118501] [2020-11-28 07:38:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:16,426 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:38:16,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106118501] [2020-11-28 07:38:16,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:16,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:38:16,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256908085] [2020-11-28 07:38:16,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:38:16,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:38:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:38:16,428 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-11-28 07:38:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:16,653 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-11-28 07:38:16,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:38:16,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-28 07:38:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:16,659 INFO L225 Difference]: With dead ends: 440 [2020-11-28 07:38:16,659 INFO L226 Difference]: Without dead ends: 392 [2020-11-28 07:38:16,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-28 07:38:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-28 07:38:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-11-28 07:38:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-11-28 07:38:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-11-28 07:38:16,681 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-11-28 07:38:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:16,681 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-11-28 07:38:16,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:38:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-11-28 07:38:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:38:16,683 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:16,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:16,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:38:16,684 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-11-28 07:38:16,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:16,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590584584] [2020-11-28 07:38:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:16,841 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:38:16,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590584584] [2020-11-28 07:38:16,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:16,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:38:16,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658656078] [2020-11-28 07:38:16,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:38:16,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:38:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:16,843 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-11-28 07:38:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:16,927 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-11-28 07:38:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:38:16,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 07:38:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:16,932 INFO L225 Difference]: With dead ends: 384 [2020-11-28 07:38:16,932 INFO L226 Difference]: Without dead ends: 280 [2020-11-28 07:38:16,932 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:38:16,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-11-28 07:38:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-11-28 07:38:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-28 07:38:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-11-28 07:38:16,945 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-11-28 07:38:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:16,946 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-11-28 07:38:16,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:38:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-11-28 07:38:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 07:38:16,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:16,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:38:16,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:38:16,948 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-11-28 07:38:16,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:16,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224325030] [2020-11-28 07:38:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:17,080 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:38:17,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224325030] [2020-11-28 07:38:17,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:17,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:38:17,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896257185] [2020-11-28 07:38:17,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:38:17,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:17,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:38:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:38:17,082 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-11-28 07:38:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:17,156 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-11-28 07:38:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:38:17,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-28 07:38:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:17,158 INFO L225 Difference]: With dead ends: 230 [2020-11-28 07:38:17,159 INFO L226 Difference]: Without dead ends: 176 [2020-11-28 07:38:17,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:38:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-28 07:38:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-11-28 07:38:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-28 07:38:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-11-28 07:38:17,168 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-11-28 07:38:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:17,170 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-11-28 07:38:17,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:38:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-11-28 07:38:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-28 07:38:17,171 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:17,171 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:38:17,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:38:17,172 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-11-28 07:38:17,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:17,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024810985] [2020-11-28 07:38:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:17,339 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:38:17,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024810985] [2020-11-28 07:38:17,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:17,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:38:17,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398626716] [2020-11-28 07:38:17,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:38:17,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:38:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:38:17,342 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-11-28 07:38:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:17,433 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-11-28 07:38:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:38:17,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-28 07:38:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:17,435 INFO L225 Difference]: With dead ends: 157 [2020-11-28 07:38:17,435 INFO L226 Difference]: Without dead ends: 97 [2020-11-28 07:38:17,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:38:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-28 07:38:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-11-28 07:38:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-28 07:38:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-11-28 07:38:17,440 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-11-28 07:38:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:17,441 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-11-28 07:38:17,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:38:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-11-28 07:38:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 07:38:17,442 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:17,442 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:38:17,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 07:38:17,443 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-11-28 07:38:17,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:17,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937623197] [2020-11-28 07:38:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:17,560 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:38:17,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937623197] [2020-11-28 07:38:17,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:17,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:38:17,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55475502] [2020-11-28 07:38:17,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:38:17,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:38:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:38:17,562 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 6 states. [2020-11-28 07:38:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:17,691 INFO L93 Difference]: Finished difference Result 141 states and 289 transitions. [2020-11-28 07:38:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:38:17,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 07:38:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:17,693 INFO L225 Difference]: With dead ends: 141 [2020-11-28 07:38:17,693 INFO L226 Difference]: Without dead ends: 75 [2020-11-28 07:38:17,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-28 07:38:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-28 07:38:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-11-28 07:38:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-28 07:38:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2020-11-28 07:38:17,697 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 20 [2020-11-28 07:38:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:17,698 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 152 transitions. [2020-11-28 07:38:17,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:38:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 152 transitions. [2020-11-28 07:38:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 07:38:17,699 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:17,699 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:38:17,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 07:38:17,699 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956750, now seen corresponding path program 2 times [2020-11-28 07:38:17,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:17,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215292335] [2020-11-28 07:38:17,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:38:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:38:17,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215292335] [2020-11-28 07:38:17,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:38:17,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:38:17,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218073657] [2020-11-28 07:38:17,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:38:17,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:38:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:38:17,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:38:17,763 INFO L87 Difference]: Start difference. First operand 75 states and 152 transitions. Second operand 4 states. [2020-11-28 07:38:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:38:17,788 INFO L93 Difference]: Finished difference Result 101 states and 200 transitions. [2020-11-28 07:38:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:38:17,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-28 07:38:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:38:17,790 INFO L225 Difference]: With dead ends: 101 [2020-11-28 07:38:17,790 INFO L226 Difference]: Without dead ends: 47 [2020-11-28 07:38:17,791 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:38:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-28 07:38:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-28 07:38:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-28 07:38:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-11-28 07:38:17,793 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-11-28 07:38:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:38:17,793 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-11-28 07:38:17,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:38:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-11-28 07:38:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 07:38:17,794 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:38:17,794 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:38:17,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 07:38:17,794 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:38:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:38:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-11-28 07:38:17,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:38:17,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026370465] [2020-11-28 07:38:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:38:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:38:17,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:38:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:38:17,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:38:17,953 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:38:17,953 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:38:17,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 07:38:17,955 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 07:38:17,972 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-1064778403 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1064778403 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1064778403 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1064778403 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and .cse0 (or (and .cse1 (= ~y~0_In-1064778403 ~y~0_Out-1064778403)) (and .cse2 (= ~y$w_buff1~0_In-1064778403 ~y~0_Out-1064778403) .cse3))) (and .cse4 .cse5 (= ~y$w_buff0~0_In-1064778403 ~y~0_Out-1064778403))) (or (and .cse2 (= ~y$w_buff1_used~0_Out-1064778403 0) .cse3) (and .cse1 (= ~y$w_buff1_used~0_Out-1064778403 ~y$w_buff1_used~0_In-1064778403))) (or (and .cse4 (= ~y$w_buff0_used~0_Out-1064778403 0) .cse5) (and (= ~y$w_buff0_used~0_In-1064778403 ~y$w_buff0_used~0_Out-1064778403) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403| ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403) (= ~y$r_buff1_thd0~0_In-1064778403 ~y$r_buff1_thd0~0_Out-1064778403) (= ~y$r_buff0_thd0~0_Out-1064778403 ~y$r_buff0_thd0~0_In-1064778403)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1064778403, ~y$w_buff1~0=~y$w_buff1~0_In-1064778403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1064778403, ~y$w_buff0~0=~y$w_buff0~0_In-1064778403, ~y~0=~y~0_In-1064778403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1064778403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1064778403} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1064778403, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1064778403|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1064778403|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1064778403|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1064778403|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1064778403|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1064778403|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403, ~y$w_buff1~0=~y$w_buff1~0_In-1064778403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1064778403, ~y$w_buff0~0=~y$w_buff0~0_In-1064778403, ~y~0=~y~0_Out-1064778403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1064778403, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1064778403} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 07:38:17,982 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:38:17,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,984 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:38:17,984 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-28 07:38:17,986 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:38:17,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,987 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:38:17,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,987 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:38:17,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,988 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:38:17,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,988 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:38:17,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,989 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:38:17,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,989 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:38:17,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,990 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:38:17,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,991 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:38:17,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,991 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:38:17,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,992 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:38:17,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,993 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:38:17,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,993 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:38:17,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,993 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:38:17,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,994 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:38:17,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:17,994 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:38:17,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,000 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:38:18,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,000 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:38:18,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,001 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:38:18,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,001 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:38:18,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,002 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:38:18,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,002 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:38:18,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:38:18 BasicIcfg [2020-11-28 07:38:18,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:38:18,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:38:18,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:38:18,085 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:38:18,086 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:38:03" (3/4) ... [2020-11-28 07:38:18,088 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:38:18,099 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-1064778403 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1064778403 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-1064778403 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-1064778403 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (or (and .cse0 (or (and .cse1 (= ~y~0_In-1064778403 ~y~0_Out-1064778403)) (and .cse2 (= ~y$w_buff1~0_In-1064778403 ~y~0_Out-1064778403) .cse3))) (and .cse4 .cse5 (= ~y$w_buff0~0_In-1064778403 ~y~0_Out-1064778403))) (or (and .cse2 (= ~y$w_buff1_used~0_Out-1064778403 0) .cse3) (and .cse1 (= ~y$w_buff1_used~0_Out-1064778403 ~y$w_buff1_used~0_In-1064778403))) (or (and .cse4 (= ~y$w_buff0_used~0_Out-1064778403 0) .cse5) (and (= ~y$w_buff0_used~0_In-1064778403 ~y$w_buff0_used~0_Out-1064778403) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403| ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403) (= ~y$r_buff1_thd0~0_In-1064778403 ~y$r_buff1_thd0~0_Out-1064778403) (= ~y$r_buff0_thd0~0_Out-1064778403 ~y$r_buff0_thd0~0_In-1064778403)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1064778403, ~y$w_buff1~0=~y$w_buff1~0_In-1064778403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1064778403, ~y$w_buff0~0=~y$w_buff0~0_In-1064778403, ~y~0=~y~0_In-1064778403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1064778403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1064778403} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1064778403, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1064778403|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1064778403|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1064778403|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1064778403|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1064778403|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1064778403|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1064778403|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1064778403, ~y$w_buff1~0=~y$w_buff1~0_In-1064778403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1064778403, ~y$w_buff0~0=~y$w_buff0~0_In-1064778403, ~y~0=~y~0_Out-1064778403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1064778403, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1064778403} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-28 07:38:18,101 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:38:18,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,102 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:38:18,102 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-11-28 07:38:18,102 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:38:18,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,103 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:38:18,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,103 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:38:18,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,103 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:38:18,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,104 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:38:18,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,104 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:38:18,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,105 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:38:18,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,105 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:38:18,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,105 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:38:18,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,106 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:38:18,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,106 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:38:18,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,107 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:38:18,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,107 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:38:18,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,107 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:38:18,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,108 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:38:18,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,108 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:38:18,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,108 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:38:18,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,109 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:38:18,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,109 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:38:18,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,109 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:38:18,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,109 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:38:18,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,110 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:38:18,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:38:18,232 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c033184a-a383-43f5-93a9-cc47f0822949/bin/utaipan/witness.graphml [2020-11-28 07:38:18,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:38:18,234 INFO L168 Benchmark]: Toolchain (without parser) took 18162.36 ms. Allocated memory was 119.5 MB in the beginning and 262.1 MB in the end (delta: 142.6 MB). Free memory was 85.8 MB in the beginning and 96.5 MB in the end (delta: -10.7 MB). Peak memory consumption was 132.4 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,234 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 77.6 MB. Free memory was 35.5 MB in the beginning and 35.5 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:38:18,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.71 ms. Allocated memory is still 119.5 MB. Free memory was 85.5 MB in the beginning and 71.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.78 ms. Allocated memory is still 119.5 MB. Free memory was 71.0 MB in the beginning and 68.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,236 INFO L168 Benchmark]: Boogie Preprocessor took 36.71 ms. Allocated memory is still 119.5 MB. Free memory was 68.2 MB in the beginning and 66.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,237 INFO L168 Benchmark]: RCFGBuilder took 2599.08 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 66.1 MB in the beginning and 73.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,238 INFO L168 Benchmark]: TraceAbstraction took 14620.35 ms. Allocated memory was 144.7 MB in the beginning and 262.1 MB in the end (delta: 117.4 MB). Free memory was 72.2 MB in the beginning and 110.1 MB in the end (delta: -38.0 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,238 INFO L168 Benchmark]: Witness Printer took 147.52 ms. Allocated memory is still 262.1 MB. Free memory was 110.1 MB in the beginning and 96.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:38:18,241 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.25 ms. Allocated memory is still 77.6 MB. Free memory was 35.5 MB in the beginning and 35.5 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 670.71 ms. Allocated memory is still 119.5 MB. Free memory was 85.5 MB in the beginning and 71.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.78 ms. Allocated memory is still 119.5 MB. Free memory was 71.0 MB in the beginning and 68.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.71 ms. Allocated memory is still 119.5 MB. Free memory was 68.2 MB in the beginning and 66.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2599.08 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 66.1 MB in the beginning and 73.2 MB in the end (delta: -7.1 MB). Peak memory consumption was 48.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14620.35 ms. Allocated memory was 144.7 MB in the beginning and 262.1 MB in the end (delta: 117.4 MB). Free memory was 72.2 MB in the beginning and 110.1 MB in the end (delta: -38.0 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.1 GB. * Witness Printer took 147.52 ms. Allocated memory is still 262.1 MB. Free memory was 110.1 MB in the beginning and 96.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4721 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2528; [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2529; [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2530; [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 280 SDtfs, 299 SDslu, 398 SDs, 0 SdLazy, 258 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 11887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...