./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe005_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe005_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c36fe413706bed9d691ac2bda558daf7ae17c337 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.25-f470102 [2019-12-07 19:03:49,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:03:49,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:03:49,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:03:49,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:03:49,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:03:49,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:03:49,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:03:49,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:03:49,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:03:49,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:03:49,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:03:49,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:03:49,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:03:49,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:03:49,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:03:49,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:03:49,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:03:49,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:03:49,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:03:49,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:03:49,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:03:49,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:03:49,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:03:49,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:03:49,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:03:49,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:03:49,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:03:49,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:03:49,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:03:49,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:03:49,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:03:49,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:03:49,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:03:49,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:03:49,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:03:49,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:03:49,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:03:49,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:03:49,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:03:49,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:03:49,774 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:03:49,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:03:49,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:03:49,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:03:49,788 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:03:49,788 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:03:49,788 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:03:49,789 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:03:49,790 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:03:49,790 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:03:49,790 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:03:49,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:03:49,791 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:03:49,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:03:49,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:03:49,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:03:49,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:03:49,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:03:49,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:03:49,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:03:49,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:03:49,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:03:49,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:03:49,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:03:49,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:03:49,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:03:49,795 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_223d5663-49e1-496c-8a06-705982c3a951/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(__VERIFIER_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 -> c36fe413706bed9d691ac2bda558daf7ae17c337 [2019-12-07 19:03:49,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:03:49,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:03:49,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:03:49,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:03:49,914 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:03:49,915 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe005_pso.opt.i [2019-12-07 19:03:49,957 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/data/ed7d73203/c9fff9ee020a42f5b8915f278aec8ac1/FLAG8a42ae0ee [2019-12-07 19:03:50,309 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:03:50,309 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/sv-benchmarks/c/pthread-wmm/safe005_pso.opt.i [2019-12-07 19:03:50,319 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/data/ed7d73203/c9fff9ee020a42f5b8915f278aec8ac1/FLAG8a42ae0ee [2019-12-07 19:03:50,328 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/data/ed7d73203/c9fff9ee020a42f5b8915f278aec8ac1 [2019-12-07 19:03:50,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:03:50,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:03:50,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:03:50,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:03:50,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:03:50,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50, skipping insertion in model container [2019-12-07 19:03:50,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:03:50,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:03:50,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:03:50,616 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:03:50,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:03:50,697 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:03:50,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50 WrapperNode [2019-12-07 19:03:50,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:03:50,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:03:50,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:03:50,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:03:50,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:03:50,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:03:50,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:03:50,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:03:50,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... [2019-12-07 19:03:50,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:03:50,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:03:50,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:03:50,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:03:50,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/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 [2019-12-07 19:03:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:03:50,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:03:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:03:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:03:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:03:50,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:03:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:03:50,800 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 19:03:51,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:03:51,147 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:03:51,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:03:51 BoogieIcfgContainer [2019-12-07 19:03:51,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:03:51,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:03:51,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:03:51,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:03:51,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:03:50" (1/3) ... [2019-12-07 19:03:51,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:03:51, skipping insertion in model container [2019-12-07 19:03:51,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:03:50" (2/3) ... [2019-12-07 19:03:51,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:03:51, skipping insertion in model container [2019-12-07 19:03:51,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:03:51" (3/3) ... [2019-12-07 19:03:51,153 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2019-12-07 19:03:51,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:03:51,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:03:51,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:03:51,165 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:03:51,226 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:03:51,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:03:51,239 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:03:51,239 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:03:51,239 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:03:51,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:03:51,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:03:51,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:03:51,240 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:03:51,250 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 19:03:51,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 19:03:51,312 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 19:03:51,312 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:03:51,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:03:51,341 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 19:03:51,371 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 19:03:51,371 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:03:51,376 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:03:51,392 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:03:51,393 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:03:54,405 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:03:54,544 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-07 19:03:54,544 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-07 19:03:54,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 19:04:04,326 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 19:04:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 19:04:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:04:04,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:04,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:04:04,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-07 19:04:04,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:04,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230283535] [2019-12-07 19:04:04,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:04,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230283535] [2019-12-07 19:04:04,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:04,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:04:04,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991057049] [2019-12-07 19:04:04,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:04,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:04,497 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 19:04:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:05,080 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 19:04:05,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:05,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:04:05,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:05,632 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 19:04:05,633 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 19:04:05,634 INFO L630 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 [2019-12-07 19:04:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 19:04:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 19:04:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 19:04:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 19:04:10,153 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 19:04:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 19:04:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 19:04:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:04:10,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:10,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:10,161 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-07 19:04:10,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:10,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545198558] [2019-12-07 19:04:10,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:10,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545198558] [2019-12-07 19:04:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:10,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:10,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403777212] [2019-12-07 19:04:10,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:04:10,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:04:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:04:10,222 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 19:04:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:12,392 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 19:04:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:04:12,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:04:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:12,740 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 19:04:12,740 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 19:04:12,741 INFO L630 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 [2019-12-07 19:04:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 19:04:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 19:04:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 19:04:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 19:04:18,143 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 19:04:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:18,143 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 19:04:18,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:04:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 19:04:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:04:18,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:18,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:18,146 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-07 19:04:18,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:18,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897011796] [2019-12-07 19:04:18,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:18,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897011796] [2019-12-07 19:04:18,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:18,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:18,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134823701] [2019-12-07 19:04:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:04:18,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:04:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:04:18,214 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 19:04:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:18,344 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-07 19:04:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:04:18,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:04:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:18,395 INFO L225 Difference]: With dead ends: 36525 [2019-12-07 19:04:18,395 INFO L226 Difference]: Without dead ends: 28771 [2019-12-07 19:04:18,395 INFO L630 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 [2019-12-07 19:04:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-07 19:04:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-07 19:04:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-07 19:04:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-07 19:04:18,926 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-07 19:04:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:18,927 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-07 19:04:18,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:04:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-07 19:04:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:04:18,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:18,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:18,929 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-07 19:04:18,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:18,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988098147] [2019-12-07 19:04:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:18,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988098147] [2019-12-07 19:04:18,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:18,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:18,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075804890] [2019-12-07 19:04:18,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:18,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:18,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:18,956 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 3 states. [2019-12-07 19:04:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:19,371 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-07 19:04:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:19,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:04:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:19,439 INFO L225 Difference]: With dead ends: 42081 [2019-12-07 19:04:19,439 INFO L226 Difference]: Without dead ends: 42081 [2019-12-07 19:04:19,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-07 19:04:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-07 19:04:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-07 19:04:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-07 19:04:20,063 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-07 19:04:20,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:20,064 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-07 19:04:20,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-07 19:04:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:04:20,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:20,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:20,065 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-07 19:04:20,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:20,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653939465] [2019-12-07 19:04:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:20,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653939465] [2019-12-07 19:04:20,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:20,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:20,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609935680] [2019-12-07 19:04:20,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:04:20,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:20,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:04:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:04:20,099 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 4 states. [2019-12-07 19:04:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:20,315 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-07 19:04:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:04:20,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:04:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:20,377 INFO L225 Difference]: With dead ends: 39611 [2019-12-07 19:04:20,377 INFO L226 Difference]: Without dead ends: 39522 [2019-12-07 19:04:20,377 INFO L630 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 [2019-12-07 19:04:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-07 19:04:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-07 19:04:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-07 19:04:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-07 19:04:21,004 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-07 19:04:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:21,005 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-07 19:04:21,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:04:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-07 19:04:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:04:21,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:21,006 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:21,006 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:21,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-07 19:04:21,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:21,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049287913] [2019-12-07 19:04:21,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:21,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049287913] [2019-12-07 19:04:21,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:21,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:21,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722423449] [2019-12-07 19:04:21,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:04:21,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:04:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:04:21,040 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 4 states. [2019-12-07 19:04:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:21,263 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-07 19:04:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:04:21,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:04:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:21,327 INFO L225 Difference]: With dead ends: 42436 [2019-12-07 19:04:21,327 INFO L226 Difference]: Without dead ends: 42329 [2019-12-07 19:04:21,327 INFO L630 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 [2019-12-07 19:04:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-07 19:04:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-07 19:04:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-07 19:04:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-07 19:04:22,127 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-07 19:04:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:22,127 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-07 19:04:22,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:04:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-07 19:04:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:04:22,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:22,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:22,136 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-07 19:04:22,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:22,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752925552] [2019-12-07 19:04:22,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:22,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752925552] [2019-12-07 19:04:22,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:22,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:22,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015735647] [2019-12-07 19:04:22,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:22,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:22,177 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-07 19:04:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:22,598 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-07 19:04:22,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:04:22,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:04:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:22,670 INFO L225 Difference]: With dead ends: 48205 [2019-12-07 19:04:22,670 INFO L226 Difference]: Without dead ends: 48029 [2019-12-07 19:04:22,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:04:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-07 19:04:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-07 19:04:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-07 19:04:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-07 19:04:23,376 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-07 19:04:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-07 19:04:23,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-07 19:04:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:04:23,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:23,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:23,384 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-07 19:04:23,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:23,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955686262] [2019-12-07 19:04:23,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:23,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955686262] [2019-12-07 19:04:23,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:23,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:23,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476548012] [2019-12-07 19:04:23,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:23,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:23,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:23,448 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 5 states. [2019-12-07 19:04:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:23,836 INFO L93 Difference]: Finished difference Result 49034 states and 160234 transitions. [2019-12-07 19:04:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:04:23,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 19:04:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:23,914 INFO L225 Difference]: With dead ends: 49034 [2019-12-07 19:04:23,915 INFO L226 Difference]: Without dead ends: 48752 [2019-12-07 19:04:23,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:04:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48752 states. [2019-12-07 19:04:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48752 to 34955. [2019-12-07 19:04:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-07 19:04:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 116069 transitions. [2019-12-07 19:04:24,657 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 116069 transitions. Word has length 22 [2019-12-07 19:04:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:24,657 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 116069 transitions. [2019-12-07 19:04:24,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 116069 transitions. [2019-12-07 19:04:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:04:24,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:24,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:24,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-07 19:04:24,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:24,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424124461] [2019-12-07 19:04:24,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:24,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424124461] [2019-12-07 19:04:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:24,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:04:24,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733863869] [2019-12-07 19:04:24,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:24,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:24,723 INFO L87 Difference]: Start difference. First operand 34955 states and 116069 transitions. Second operand 5 states. [2019-12-07 19:04:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:24,803 INFO L93 Difference]: Finished difference Result 16209 states and 50097 transitions. [2019-12-07 19:04:24,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:04:24,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:04:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:24,821 INFO L225 Difference]: With dead ends: 16209 [2019-12-07 19:04:24,821 INFO L226 Difference]: Without dead ends: 13847 [2019-12-07 19:04:24,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:04:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-12-07 19:04:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 13663. [2019-12-07 19:04:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13663 states. [2019-12-07 19:04:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13663 states to 13663 states and 41954 transitions. [2019-12-07 19:04:25,014 INFO L78 Accepts]: Start accepts. Automaton has 13663 states and 41954 transitions. Word has length 25 [2019-12-07 19:04:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:25,014 INFO L462 AbstractCegarLoop]: Abstraction has 13663 states and 41954 transitions. [2019-12-07 19:04:25,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 13663 states and 41954 transitions. [2019-12-07 19:04:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:04:25,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:25,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:25,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:25,033 INFO L82 PathProgramCache]: Analyzing trace with hash -672186652, now seen corresponding path program 1 times [2019-12-07 19:04:25,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:25,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268822986] [2019-12-07 19:04:25,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:25,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268822986] [2019-12-07 19:04:25,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:25,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:04:25,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038998139] [2019-12-07 19:04:25,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:25,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:25,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:25,083 INFO L87 Difference]: Start difference. First operand 13663 states and 41954 transitions. Second operand 5 states. [2019-12-07 19:04:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:25,428 INFO L93 Difference]: Finished difference Result 20981 states and 63306 transitions. [2019-12-07 19:04:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:04:25,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 19:04:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:25,450 INFO L225 Difference]: With dead ends: 20981 [2019-12-07 19:04:25,450 INFO L226 Difference]: Without dead ends: 20981 [2019-12-07 19:04:25,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:04:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20981 states. [2019-12-07 19:04:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20981 to 15669. [2019-12-07 19:04:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15669 states. [2019-12-07 19:04:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15669 states to 15669 states and 48116 transitions. [2019-12-07 19:04:25,701 INFO L78 Accepts]: Start accepts. Automaton has 15669 states and 48116 transitions. Word has length 39 [2019-12-07 19:04:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:25,701 INFO L462 AbstractCegarLoop]: Abstraction has 15669 states and 48116 transitions. [2019-12-07 19:04:25,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 15669 states and 48116 transitions. [2019-12-07 19:04:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:04:25,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:25,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:25,722 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:25,723 INFO L82 PathProgramCache]: Analyzing trace with hash 445081368, now seen corresponding path program 2 times [2019-12-07 19:04:25,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:25,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534239787] [2019-12-07 19:04:25,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:25,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534239787] [2019-12-07 19:04:25,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:25,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:04:25,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446274487] [2019-12-07 19:04:25,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:25,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:25,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:25,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:25,778 INFO L87 Difference]: Start difference. First operand 15669 states and 48116 transitions. Second operand 6 states. [2019-12-07 19:04:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:26,255 INFO L93 Difference]: Finished difference Result 25968 states and 78661 transitions. [2019-12-07 19:04:26,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:04:26,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 19:04:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:26,286 INFO L225 Difference]: With dead ends: 25968 [2019-12-07 19:04:26,286 INFO L226 Difference]: Without dead ends: 25968 [2019-12-07 19:04:26,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:04:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25968 states. [2019-12-07 19:04:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25968 to 18882. [2019-12-07 19:04:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18882 states. [2019-12-07 19:04:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18882 states to 18882 states and 57424 transitions. [2019-12-07 19:04:26,593 INFO L78 Accepts]: Start accepts. Automaton has 18882 states and 57424 transitions. Word has length 39 [2019-12-07 19:04:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:26,593 INFO L462 AbstractCegarLoop]: Abstraction has 18882 states and 57424 transitions. [2019-12-07 19:04:26,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18882 states and 57424 transitions. [2019-12-07 19:04:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:04:26,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:26,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:26,617 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:26,618 INFO L82 PathProgramCache]: Analyzing trace with hash 176921666, now seen corresponding path program 3 times [2019-12-07 19:04:26,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:26,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278486051] [2019-12-07 19:04:26,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:26,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278486051] [2019-12-07 19:04:26,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:26,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:04:26,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340656562] [2019-12-07 19:04:26,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:26,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:26,690 INFO L87 Difference]: Start difference. First operand 18882 states and 57424 transitions. Second operand 6 states. [2019-12-07 19:04:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:27,185 INFO L93 Difference]: Finished difference Result 25112 states and 74963 transitions. [2019-12-07 19:04:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:04:27,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 19:04:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:27,213 INFO L225 Difference]: With dead ends: 25112 [2019-12-07 19:04:27,213 INFO L226 Difference]: Without dead ends: 25112 [2019-12-07 19:04:27,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:04:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25112 states. [2019-12-07 19:04:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25112 to 19606. [2019-12-07 19:04:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19606 states. [2019-12-07 19:04:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19606 states to 19606 states and 59558 transitions. [2019-12-07 19:04:27,524 INFO L78 Accepts]: Start accepts. Automaton has 19606 states and 59558 transitions. Word has length 39 [2019-12-07 19:04:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:27,524 INFO L462 AbstractCegarLoop]: Abstraction has 19606 states and 59558 transitions. [2019-12-07 19:04:27,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 19606 states and 59558 transitions. [2019-12-07 19:04:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:04:27,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:27,541 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:27,541 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2037054658, now seen corresponding path program 4 times [2019-12-07 19:04:27,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:27,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478457743] [2019-12-07 19:04:27,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:27,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478457743] [2019-12-07 19:04:27,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:27,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:27,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731033945] [2019-12-07 19:04:27,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:27,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:27,599 INFO L87 Difference]: Start difference. First operand 19606 states and 59558 transitions. Second operand 5 states. [2019-12-07 19:04:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:27,746 INFO L93 Difference]: Finished difference Result 48248 states and 146641 transitions. [2019-12-07 19:04:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:04:27,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 19:04:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:27,785 INFO L225 Difference]: With dead ends: 48248 [2019-12-07 19:04:27,785 INFO L226 Difference]: Without dead ends: 28417 [2019-12-07 19:04:27,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28417 states. [2019-12-07 19:04:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28417 to 28151. [2019-12-07 19:04:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28151 states. [2019-12-07 19:04:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28151 states to 28151 states and 85532 transitions. [2019-12-07 19:04:28,214 INFO L78 Accepts]: Start accepts. Automaton has 28151 states and 85532 transitions. Word has length 39 [2019-12-07 19:04:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:28,215 INFO L462 AbstractCegarLoop]: Abstraction has 28151 states and 85532 transitions. [2019-12-07 19:04:28,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28151 states and 85532 transitions. [2019-12-07 19:04:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:04:28,243 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:28,243 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:28,243 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-07 19:04:28,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:28,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871707681] [2019-12-07 19:04:28,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:28,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871707681] [2019-12-07 19:04:28,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:28,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:04:28,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515959329] [2019-12-07 19:04:28,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:28,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:28,289 INFO L87 Difference]: Start difference. First operand 28151 states and 85532 transitions. Second operand 6 states. [2019-12-07 19:04:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:28,697 INFO L93 Difference]: Finished difference Result 33014 states and 98747 transitions. [2019-12-07 19:04:28,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:04:28,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 19:04:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:28,736 INFO L225 Difference]: With dead ends: 33014 [2019-12-07 19:04:28,736 INFO L226 Difference]: Without dead ends: 32788 [2019-12-07 19:04:28,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:04:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32788 states. [2019-12-07 19:04:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32788 to 29556. [2019-12-07 19:04:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29556 states. [2019-12-07 19:04:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29556 states to 29556 states and 89493 transitions. [2019-12-07 19:04:29,171 INFO L78 Accepts]: Start accepts. Automaton has 29556 states and 89493 transitions. Word has length 40 [2019-12-07 19:04:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:29,171 INFO L462 AbstractCegarLoop]: Abstraction has 29556 states and 89493 transitions. [2019-12-07 19:04:29,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29556 states and 89493 transitions. [2019-12-07 19:04:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:04:29,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:29,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:29,202 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1884333106, now seen corresponding path program 1 times [2019-12-07 19:04:29,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:29,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743488367] [2019-12-07 19:04:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743488367] [2019-12-07 19:04:29,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:04:29,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384923569] [2019-12-07 19:04:29,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:29,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:29,224 INFO L87 Difference]: Start difference. First operand 29556 states and 89493 transitions. Second operand 3 states. [2019-12-07 19:04:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:29,334 INFO L93 Difference]: Finished difference Result 34713 states and 102369 transitions. [2019-12-07 19:04:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:29,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 19:04:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:29,378 INFO L225 Difference]: With dead ends: 34713 [2019-12-07 19:04:29,379 INFO L226 Difference]: Without dead ends: 34713 [2019-12-07 19:04:29,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34713 states. [2019-12-07 19:04:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34713 to 30895. [2019-12-07 19:04:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30895 states. [2019-12-07 19:04:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30895 states to 30895 states and 91697 transitions. [2019-12-07 19:04:29,838 INFO L78 Accepts]: Start accepts. Automaton has 30895 states and 91697 transitions. Word has length 40 [2019-12-07 19:04:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:29,838 INFO L462 AbstractCegarLoop]: Abstraction has 30895 states and 91697 transitions. [2019-12-07 19:04:29,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30895 states and 91697 transitions. [2019-12-07 19:04:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:04:29,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:29,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:29,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 1 times [2019-12-07 19:04:29,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:29,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017338669] [2019-12-07 19:04:29,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:29,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017338669] [2019-12-07 19:04:29,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:29,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:04:29,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395782517] [2019-12-07 19:04:29,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:29,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:29,923 INFO L87 Difference]: Start difference. First operand 30895 states and 91697 transitions. Second operand 6 states. [2019-12-07 19:04:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:30,605 INFO L93 Difference]: Finished difference Result 41616 states and 121333 transitions. [2019-12-07 19:04:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:04:30,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 19:04:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:30,652 INFO L225 Difference]: With dead ends: 41616 [2019-12-07 19:04:30,652 INFO L226 Difference]: Without dead ends: 41616 [2019-12-07 19:04:30,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:04:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41616 states. [2019-12-07 19:04:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41616 to 30381. [2019-12-07 19:04:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30381 states. [2019-12-07 19:04:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30381 states to 30381 states and 90252 transitions. [2019-12-07 19:04:31,272 INFO L78 Accepts]: Start accepts. Automaton has 30381 states and 90252 transitions. Word has length 40 [2019-12-07 19:04:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:31,272 INFO L462 AbstractCegarLoop]: Abstraction has 30381 states and 90252 transitions. [2019-12-07 19:04:31,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 30381 states and 90252 transitions. [2019-12-07 19:04:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:04:31,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:31,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:31,301 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:31,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-07 19:04:31,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:31,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205114179] [2019-12-07 19:04:31,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:31,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205114179] [2019-12-07 19:04:31,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:31,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:04:31,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652876551] [2019-12-07 19:04:31,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:31,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:31,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:31,345 INFO L87 Difference]: Start difference. First operand 30381 states and 90252 transitions. Second operand 6 states. [2019-12-07 19:04:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:31,762 INFO L93 Difference]: Finished difference Result 34469 states and 101193 transitions. [2019-12-07 19:04:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:04:31,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 19:04:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:31,801 INFO L225 Difference]: With dead ends: 34469 [2019-12-07 19:04:31,801 INFO L226 Difference]: Without dead ends: 34197 [2019-12-07 19:04:31,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:04:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34197 states. [2019-12-07 19:04:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34197 to 30050. [2019-12-07 19:04:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30050 states. [2019-12-07 19:04:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30050 states to 30050 states and 89585 transitions. [2019-12-07 19:04:32,243 INFO L78 Accepts]: Start accepts. Automaton has 30050 states and 89585 transitions. Word has length 41 [2019-12-07 19:04:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:32,243 INFO L462 AbstractCegarLoop]: Abstraction has 30050 states and 89585 transitions. [2019-12-07 19:04:32,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 30050 states and 89585 transitions. [2019-12-07 19:04:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 19:04:32,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:32,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:32,272 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:32,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:32,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-07 19:04:32,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:32,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212032426] [2019-12-07 19:04:32,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:32,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212032426] [2019-12-07 19:04:32,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:32,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:04:32,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959378556] [2019-12-07 19:04:32,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:04:32,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:32,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:04:32,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:32,350 INFO L87 Difference]: Start difference. First operand 30050 states and 89585 transitions. Second operand 6 states. [2019-12-07 19:04:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:32,466 INFO L93 Difference]: Finished difference Result 28229 states and 85095 transitions. [2019-12-07 19:04:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:04:32,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 19:04:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:32,502 INFO L225 Difference]: With dead ends: 28229 [2019-12-07 19:04:32,502 INFO L226 Difference]: Without dead ends: 27749 [2019-12-07 19:04:32,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:04:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27749 states. [2019-12-07 19:04:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27749 to 16331. [2019-12-07 19:04:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16331 states. [2019-12-07 19:04:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16331 states to 16331 states and 49436 transitions. [2019-12-07 19:04:32,815 INFO L78 Accepts]: Start accepts. Automaton has 16331 states and 49436 transitions. Word has length 41 [2019-12-07 19:04:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:32,815 INFO L462 AbstractCegarLoop]: Abstraction has 16331 states and 49436 transitions. [2019-12-07 19:04:32,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:04:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16331 states and 49436 transitions. [2019-12-07 19:04:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:04:32,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:32,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:32,830 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1456504328, now seen corresponding path program 1 times [2019-12-07 19:04:32,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:32,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5388091] [2019-12-07 19:04:32,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:32,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5388091] [2019-12-07 19:04:32,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:32,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:04:32,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336433068] [2019-12-07 19:04:32,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:04:32,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:32,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:04:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:04:32,974 INFO L87 Difference]: Start difference. First operand 16331 states and 49436 transitions. Second operand 10 states. [2019-12-07 19:04:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:33,849 INFO L93 Difference]: Finished difference Result 24483 states and 72822 transitions. [2019-12-07 19:04:33,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:04:33,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-07 19:04:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:33,874 INFO L225 Difference]: With dead ends: 24483 [2019-12-07 19:04:33,874 INFO L226 Difference]: Without dead ends: 24483 [2019-12-07 19:04:33,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:04:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24483 states. [2019-12-07 19:04:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24483 to 16757. [2019-12-07 19:04:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16757 states. [2019-12-07 19:04:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16757 states to 16757 states and 50683 transitions. [2019-12-07 19:04:34,161 INFO L78 Accepts]: Start accepts. Automaton has 16757 states and 50683 transitions. Word has length 54 [2019-12-07 19:04:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:34,161 INFO L462 AbstractCegarLoop]: Abstraction has 16757 states and 50683 transitions. [2019-12-07 19:04:34,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:04:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 16757 states and 50683 transitions. [2019-12-07 19:04:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:04:34,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:34,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:34,176 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -352191670, now seen corresponding path program 2 times [2019-12-07 19:04:34,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:34,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979478550] [2019-12-07 19:04:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:34,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979478550] [2019-12-07 19:04:34,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:34,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:04:34,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234567529] [2019-12-07 19:04:34,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:04:34,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:34,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:04:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:04:34,243 INFO L87 Difference]: Start difference. First operand 16757 states and 50683 transitions. Second operand 5 states. [2019-12-07 19:04:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:34,356 INFO L93 Difference]: Finished difference Result 49000 states and 149183 transitions. [2019-12-07 19:04:34,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:04:34,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-07 19:04:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:34,382 INFO L225 Difference]: With dead ends: 49000 [2019-12-07 19:04:34,382 INFO L226 Difference]: Without dead ends: 23176 [2019-12-07 19:04:34,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:04:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23176 states. [2019-12-07 19:04:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23176 to 13302. [2019-12-07 19:04:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13302 states. [2019-12-07 19:04:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13302 states to 13302 states and 40254 transitions. [2019-12-07 19:04:34,636 INFO L78 Accepts]: Start accepts. Automaton has 13302 states and 40254 transitions. Word has length 54 [2019-12-07 19:04:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:34,636 INFO L462 AbstractCegarLoop]: Abstraction has 13302 states and 40254 transitions. [2019-12-07 19:04:34,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:04:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13302 states and 40254 transitions. [2019-12-07 19:04:34,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:04:34,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:34,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:34,649 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:34,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:34,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1875911208, now seen corresponding path program 3 times [2019-12-07 19:04:34,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:34,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556622341] [2019-12-07 19:04:34,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:34,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556622341] [2019-12-07 19:04:34,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:34,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:04:34,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068477794] [2019-12-07 19:04:34,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:04:34,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:04:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:04:34,708 INFO L87 Difference]: Start difference. First operand 13302 states and 40254 transitions. Second operand 7 states. [2019-12-07 19:04:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:35,210 INFO L93 Difference]: Finished difference Result 25802 states and 76072 transitions. [2019-12-07 19:04:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:04:35,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:04:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:35,240 INFO L225 Difference]: With dead ends: 25802 [2019-12-07 19:04:35,240 INFO L226 Difference]: Without dead ends: 25802 [2019-12-07 19:04:35,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:04:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25802 states. [2019-12-07 19:04:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25802 to 13419. [2019-12-07 19:04:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13419 states. [2019-12-07 19:04:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13419 states to 13419 states and 40602 transitions. [2019-12-07 19:04:35,525 INFO L78 Accepts]: Start accepts. Automaton has 13419 states and 40602 transitions. Word has length 54 [2019-12-07 19:04:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:35,525 INFO L462 AbstractCegarLoop]: Abstraction has 13419 states and 40602 transitions. [2019-12-07 19:04:35,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:04:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 13419 states and 40602 transitions. [2019-12-07 19:04:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:04:35,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:35,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:35,537 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:35,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:35,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1406124868, now seen corresponding path program 4 times [2019-12-07 19:04:35,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:35,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345962961] [2019-12-07 19:04:35,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:35,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345962961] [2019-12-07 19:04:35,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:35,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:35,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319418121] [2019-12-07 19:04:35,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:35,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:35,574 INFO L87 Difference]: Start difference. First operand 13419 states and 40602 transitions. Second operand 3 states. [2019-12-07 19:04:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:35,610 INFO L93 Difference]: Finished difference Result 13417 states and 40597 transitions. [2019-12-07 19:04:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:35,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 19:04:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:35,625 INFO L225 Difference]: With dead ends: 13417 [2019-12-07 19:04:35,625 INFO L226 Difference]: Without dead ends: 13417 [2019-12-07 19:04:35,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13417 states. [2019-12-07 19:04:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13417 to 11247. [2019-12-07 19:04:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11247 states. [2019-12-07 19:04:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11247 states to 11247 states and 34389 transitions. [2019-12-07 19:04:35,804 INFO L78 Accepts]: Start accepts. Automaton has 11247 states and 34389 transitions. Word has length 54 [2019-12-07 19:04:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:35,804 INFO L462 AbstractCegarLoop]: Abstraction has 11247 states and 34389 transitions. [2019-12-07 19:04:35,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 11247 states and 34389 transitions. [2019-12-07 19:04:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:04:35,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:35,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:35,813 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:35,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1471935460, now seen corresponding path program 1 times [2019-12-07 19:04:35,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:35,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584198908] [2019-12-07 19:04:35,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:35,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584198908] [2019-12-07 19:04:35,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:35,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:04:35,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465965847] [2019-12-07 19:04:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:04:35,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:04:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:04:35,899 INFO L87 Difference]: Start difference. First operand 11247 states and 34389 transitions. Second operand 8 states. [2019-12-07 19:04:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:37,152 INFO L93 Difference]: Finished difference Result 47167 states and 142980 transitions. [2019-12-07 19:04:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:04:37,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 19:04:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:37,196 INFO L225 Difference]: With dead ends: 47167 [2019-12-07 19:04:37,196 INFO L226 Difference]: Without dead ends: 35834 [2019-12-07 19:04:37,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:04:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35834 states. [2019-12-07 19:04:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35834 to 14199. [2019-12-07 19:04:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14199 states. [2019-12-07 19:04:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 43447 transitions. [2019-12-07 19:04:37,561 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 43447 transitions. Word has length 55 [2019-12-07 19:04:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:37,561 INFO L462 AbstractCegarLoop]: Abstraction has 14199 states and 43447 transitions. [2019-12-07 19:04:37,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:04:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 43447 transitions. [2019-12-07 19:04:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:04:37,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:37,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:37,575 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:37,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2060072960, now seen corresponding path program 2 times [2019-12-07 19:04:37,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:37,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074888897] [2019-12-07 19:04:37,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:37,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074888897] [2019-12-07 19:04:37,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:37,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:04:37,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558116456] [2019-12-07 19:04:37,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:04:37,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:37,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:04:37,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:04:37,649 INFO L87 Difference]: Start difference. First operand 14199 states and 43447 transitions. Second operand 8 states. [2019-12-07 19:04:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:38,511 INFO L93 Difference]: Finished difference Result 58957 states and 177730 transitions. [2019-12-07 19:04:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:04:38,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-07 19:04:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:38,563 INFO L225 Difference]: With dead ends: 58957 [2019-12-07 19:04:38,563 INFO L226 Difference]: Without dead ends: 43411 [2019-12-07 19:04:38,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:04:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43411 states. [2019-12-07 19:04:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43411 to 18321. [2019-12-07 19:04:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18321 states. [2019-12-07 19:04:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 55871 transitions. [2019-12-07 19:04:39,023 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 55871 transitions. Word has length 55 [2019-12-07 19:04:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:39,023 INFO L462 AbstractCegarLoop]: Abstraction has 18321 states and 55871 transitions. [2019-12-07 19:04:39,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:04:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 55871 transitions. [2019-12-07 19:04:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:04:39,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:39,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:39,041 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash -698547904, now seen corresponding path program 3 times [2019-12-07 19:04:39,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:39,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871875398] [2019-12-07 19:04:39,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:39,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871875398] [2019-12-07 19:04:39,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:39,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:39,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488428600] [2019-12-07 19:04:39,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:39,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:39,081 INFO L87 Difference]: Start difference. First operand 18321 states and 55871 transitions. Second operand 3 states. [2019-12-07 19:04:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:39,155 INFO L93 Difference]: Finished difference Result 29971 states and 91251 transitions. [2019-12-07 19:04:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:39,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:04:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:39,168 INFO L225 Difference]: With dead ends: 29971 [2019-12-07 19:04:39,168 INFO L226 Difference]: Without dead ends: 11955 [2019-12-07 19:04:39,168 INFO L630 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 [2019-12-07 19:04:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2019-12-07 19:04:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 11955. [2019-12-07 19:04:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11955 states. [2019-12-07 19:04:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11955 states to 11955 states and 36206 transitions. [2019-12-07 19:04:39,338 INFO L78 Accepts]: Start accepts. Automaton has 11955 states and 36206 transitions. Word has length 55 [2019-12-07 19:04:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:39,338 INFO L462 AbstractCegarLoop]: Abstraction has 11955 states and 36206 transitions. [2019-12-07 19:04:39,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11955 states and 36206 transitions. [2019-12-07 19:04:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:04:39,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:39,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:39,349 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1360453796, now seen corresponding path program 4 times [2019-12-07 19:04:39,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:39,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100966053] [2019-12-07 19:04:39,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:39,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100966053] [2019-12-07 19:04:39,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:39,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 19:04:39,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475981678] [2019-12-07 19:04:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:04:39,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:04:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:04:39,517 INFO L87 Difference]: Start difference. First operand 11955 states and 36206 transitions. Second operand 13 states. [2019-12-07 19:04:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:40,711 INFO L93 Difference]: Finished difference Result 20585 states and 61186 transitions. [2019-12-07 19:04:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 19:04:40,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-07 19:04:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:40,726 INFO L225 Difference]: With dead ends: 20585 [2019-12-07 19:04:40,727 INFO L226 Difference]: Without dead ends: 14706 [2019-12-07 19:04:40,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 19:04:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14706 states. [2019-12-07 19:04:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14706 to 11971. [2019-12-07 19:04:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11971 states. [2019-12-07 19:04:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11971 states to 11971 states and 36252 transitions. [2019-12-07 19:04:40,907 INFO L78 Accepts]: Start accepts. Automaton has 11971 states and 36252 transitions. Word has length 55 [2019-12-07 19:04:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:40,907 INFO L462 AbstractCegarLoop]: Abstraction has 11971 states and 36252 transitions. [2019-12-07 19:04:40,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:04:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11971 states and 36252 transitions. [2019-12-07 19:04:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:04:40,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:40,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:40,917 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 309741880, now seen corresponding path program 5 times [2019-12-07 19:04:40,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:40,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546109922] [2019-12-07 19:04:40,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:40,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546109922] [2019-12-07 19:04:40,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:40,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:04:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975509757] [2019-12-07 19:04:40,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:04:40,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:04:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:40,946 INFO L87 Difference]: Start difference. First operand 11971 states and 36252 transitions. Second operand 3 states. [2019-12-07 19:04:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:40,970 INFO L93 Difference]: Finished difference Result 8260 states and 24930 transitions. [2019-12-07 19:04:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:04:40,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:04:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:40,979 INFO L225 Difference]: With dead ends: 8260 [2019-12-07 19:04:40,979 INFO L226 Difference]: Without dead ends: 8260 [2019-12-07 19:04:40,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:04:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2019-12-07 19:04:41,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 8151. [2019-12-07 19:04:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2019-12-07 19:04:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 24633 transitions. [2019-12-07 19:04:41,094 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 24633 transitions. Word has length 55 [2019-12-07 19:04:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:41,094 INFO L462 AbstractCegarLoop]: Abstraction has 8151 states and 24633 transitions. [2019-12-07 19:04:41,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:04:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 24633 transitions. [2019-12-07 19:04:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:41,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:41,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:41,138 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 1 times [2019-12-07 19:04:41,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:41,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937190544] [2019-12-07 19:04:41,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937190544] [2019-12-07 19:04:41,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:41,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:04:41,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356040999] [2019-12-07 19:04:41,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:04:41,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:04:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:04:41,289 INFO L87 Difference]: Start difference. First operand 8151 states and 24633 transitions. Second operand 10 states. [2019-12-07 19:04:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:41,865 INFO L93 Difference]: Finished difference Result 14076 states and 42242 transitions. [2019-12-07 19:04:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:04:41,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 19:04:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:41,881 INFO L225 Difference]: With dead ends: 14076 [2019-12-07 19:04:41,881 INFO L226 Difference]: Without dead ends: 10318 [2019-12-07 19:04:41,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:04:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10318 states. [2019-12-07 19:04:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10318 to 8477. [2019-12-07 19:04:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8477 states. [2019-12-07 19:04:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8477 states to 8477 states and 25465 transitions. [2019-12-07 19:04:42,011 INFO L78 Accepts]: Start accepts. Automaton has 8477 states and 25465 transitions. Word has length 56 [2019-12-07 19:04:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:42,011 INFO L462 AbstractCegarLoop]: Abstraction has 8477 states and 25465 transitions. [2019-12-07 19:04:42,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:04:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8477 states and 25465 transitions. [2019-12-07 19:04:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:42,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:42,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:42,018 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1236301856, now seen corresponding path program 2 times [2019-12-07 19:04:42,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:42,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025857982] [2019-12-07 19:04:42,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:42,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025857982] [2019-12-07 19:04:42,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:42,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:04:42,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67335901] [2019-12-07 19:04:42,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:04:42,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:04:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:04:42,135 INFO L87 Difference]: Start difference. First operand 8477 states and 25465 transitions. Second operand 11 states. [2019-12-07 19:04:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:42,621 INFO L93 Difference]: Finished difference Result 13395 states and 39919 transitions. [2019-12-07 19:04:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 19:04:42,621 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 19:04:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:42,634 INFO L225 Difference]: With dead ends: 13395 [2019-12-07 19:04:42,635 INFO L226 Difference]: Without dead ends: 12893 [2019-12-07 19:04:42,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:04:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12893 states. [2019-12-07 19:04:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12893 to 11581. [2019-12-07 19:04:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11581 states. [2019-12-07 19:04:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11581 states to 11581 states and 34727 transitions. [2019-12-07 19:04:42,814 INFO L78 Accepts]: Start accepts. Automaton has 11581 states and 34727 transitions. Word has length 56 [2019-12-07 19:04:42,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:42,814 INFO L462 AbstractCegarLoop]: Abstraction has 11581 states and 34727 transitions. [2019-12-07 19:04:42,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:04:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11581 states and 34727 transitions. [2019-12-07 19:04:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:42,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:42,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:42,825 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1361402628, now seen corresponding path program 3 times [2019-12-07 19:04:42,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:42,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088626839] [2019-12-07 19:04:42,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:43,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088626839] [2019-12-07 19:04:43,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:43,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 19:04:43,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623522859] [2019-12-07 19:04:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:04:43,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:43,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:04:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:04:43,091 INFO L87 Difference]: Start difference. First operand 11581 states and 34727 transitions. Second operand 14 states. [2019-12-07 19:04:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:44,699 INFO L93 Difference]: Finished difference Result 15578 states and 45941 transitions. [2019-12-07 19:04:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 19:04:44,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-07 19:04:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:44,725 INFO L225 Difference]: With dead ends: 15578 [2019-12-07 19:04:44,725 INFO L226 Difference]: Without dead ends: 15110 [2019-12-07 19:04:44,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1671, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 19:04:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15110 states. [2019-12-07 19:04:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15110 to 12205. [2019-12-07 19:04:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12205 states. [2019-12-07 19:04:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12205 states to 12205 states and 36694 transitions. [2019-12-07 19:04:44,909 INFO L78 Accepts]: Start accepts. Automaton has 12205 states and 36694 transitions. Word has length 56 [2019-12-07 19:04:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:44,909 INFO L462 AbstractCegarLoop]: Abstraction has 12205 states and 36694 transitions. [2019-12-07 19:04:44,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:04:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 12205 states and 36694 transitions. [2019-12-07 19:04:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:44,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:44,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:44,919 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -623248486, now seen corresponding path program 4 times [2019-12-07 19:04:44,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:44,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102852677] [2019-12-07 19:04:44,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:45,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102852677] [2019-12-07 19:04:45,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:45,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 19:04:45,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721776476] [2019-12-07 19:04:45,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:04:45,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:45,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:04:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:04:45,316 INFO L87 Difference]: Start difference. First operand 12205 states and 36694 transitions. Second operand 16 states. [2019-12-07 19:04:48,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:48,209 INFO L93 Difference]: Finished difference Result 16862 states and 49877 transitions. [2019-12-07 19:04:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 19:04:48,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 19:04:48,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:48,224 INFO L225 Difference]: With dead ends: 16862 [2019-12-07 19:04:48,225 INFO L226 Difference]: Without dead ends: 14478 [2019-12-07 19:04:48,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:04:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14478 states. [2019-12-07 19:04:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14478 to 12305. [2019-12-07 19:04:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12305 states. [2019-12-07 19:04:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12305 states to 12305 states and 36932 transitions. [2019-12-07 19:04:48,409 INFO L78 Accepts]: Start accepts. Automaton has 12305 states and 36932 transitions. Word has length 56 [2019-12-07 19:04:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:48,409 INFO L462 AbstractCegarLoop]: Abstraction has 12305 states and 36932 transitions. [2019-12-07 19:04:48,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:04:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 12305 states and 36932 transitions. [2019-12-07 19:04:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:48,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:48,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:48,421 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:48,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1391763290, now seen corresponding path program 5 times [2019-12-07 19:04:48,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:48,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659220452] [2019-12-07 19:04:48,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:48,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659220452] [2019-12-07 19:04:48,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:48,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:04:48,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811466951] [2019-12-07 19:04:48,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:04:48,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:04:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:04:48,551 INFO L87 Difference]: Start difference. First operand 12305 states and 36932 transitions. Second operand 11 states. [2019-12-07 19:04:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:49,074 INFO L93 Difference]: Finished difference Result 16331 states and 48425 transitions. [2019-12-07 19:04:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:04:49,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 19:04:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:49,087 INFO L225 Difference]: With dead ends: 16331 [2019-12-07 19:04:49,087 INFO L226 Difference]: Without dead ends: 12918 [2019-12-07 19:04:49,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:04:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12918 states. [2019-12-07 19:04:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12918 to 11979. [2019-12-07 19:04:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2019-12-07 19:04:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 35918 transitions. [2019-12-07 19:04:49,256 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 35918 transitions. Word has length 56 [2019-12-07 19:04:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:49,256 INFO L462 AbstractCegarLoop]: Abstraction has 11979 states and 35918 transitions. [2019-12-07 19:04:49,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:04:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 35918 transitions. [2019-12-07 19:04:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:49,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:49,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:49,267 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 985934096, now seen corresponding path program 6 times [2019-12-07 19:04:49,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:49,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28538292] [2019-12-07 19:04:49,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:49,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28538292] [2019-12-07 19:04:49,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:49,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:04:49,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570980154] [2019-12-07 19:04:49,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:04:49,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:04:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:04:49,362 INFO L87 Difference]: Start difference. First operand 11979 states and 35918 transitions. Second operand 10 states. [2019-12-07 19:04:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:49,864 INFO L93 Difference]: Finished difference Result 16299 states and 47964 transitions. [2019-12-07 19:04:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:04:49,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-07 19:04:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:49,878 INFO L225 Difference]: With dead ends: 16299 [2019-12-07 19:04:49,878 INFO L226 Difference]: Without dead ends: 13893 [2019-12-07 19:04:49,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:04:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2019-12-07 19:04:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 12253. [2019-12-07 19:04:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12253 states. [2019-12-07 19:04:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12253 states to 12253 states and 36478 transitions. [2019-12-07 19:04:50,059 INFO L78 Accepts]: Start accepts. Automaton has 12253 states and 36478 transitions. Word has length 56 [2019-12-07 19:04:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:50,060 INFO L462 AbstractCegarLoop]: Abstraction has 12253 states and 36478 transitions. [2019-12-07 19:04:50,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:04:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12253 states and 36478 transitions. [2019-12-07 19:04:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:50,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:50,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:50,070 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1957240976, now seen corresponding path program 7 times [2019-12-07 19:04:50,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:50,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014062369] [2019-12-07 19:04:50,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:50,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014062369] [2019-12-07 19:04:50,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:50,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:04:50,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426458436] [2019-12-07 19:04:50,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:04:50,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:04:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:04:50,187 INFO L87 Difference]: Start difference. First operand 12253 states and 36478 transitions. Second operand 11 states. [2019-12-07 19:04:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:50,744 INFO L93 Difference]: Finished difference Result 15664 states and 45935 transitions. [2019-12-07 19:04:50,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:04:50,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 19:04:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:50,759 INFO L225 Difference]: With dead ends: 15664 [2019-12-07 19:04:50,759 INFO L226 Difference]: Without dead ends: 13231 [2019-12-07 19:04:50,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:04:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13231 states. [2019-12-07 19:04:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13231 to 11986. [2019-12-07 19:04:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11986 states. [2019-12-07 19:04:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11986 states to 11986 states and 35717 transitions. [2019-12-07 19:04:50,957 INFO L78 Accepts]: Start accepts. Automaton has 11986 states and 35717 transitions. Word has length 56 [2019-12-07 19:04:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:50,958 INFO L462 AbstractCegarLoop]: Abstraction has 11986 states and 35717 transitions. [2019-12-07 19:04:50,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:04:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11986 states and 35717 transitions. [2019-12-07 19:04:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:50,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:50,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:50,968 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2122420018, now seen corresponding path program 8 times [2019-12-07 19:04:50,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:50,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302342389] [2019-12-07 19:04:50,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:51,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302342389] [2019-12-07 19:04:51,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:51,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 19:04:51,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186831385] [2019-12-07 19:04:51,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:04:51,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:04:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:04:51,313 INFO L87 Difference]: Start difference. First operand 11986 states and 35717 transitions. Second operand 16 states. [2019-12-07 19:04:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:52,670 INFO L93 Difference]: Finished difference Result 16945 states and 49285 transitions. [2019-12-07 19:04:52,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 19:04:52,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 19:04:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:52,685 INFO L225 Difference]: With dead ends: 16945 [2019-12-07 19:04:52,686 INFO L226 Difference]: Without dead ends: 15427 [2019-12-07 19:04:52,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 19:04:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15427 states. [2019-12-07 19:04:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15427 to 12098. [2019-12-07 19:04:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12098 states. [2019-12-07 19:04:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 35906 transitions. [2019-12-07 19:04:52,865 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 35906 transitions. Word has length 56 [2019-12-07 19:04:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:52,865 INFO L462 AbstractCegarLoop]: Abstraction has 12098 states and 35906 transitions. [2019-12-07 19:04:52,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:04:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 35906 transitions. [2019-12-07 19:04:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:52,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:52,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:52,876 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:52,876 INFO L82 PathProgramCache]: Analyzing trace with hash -355930136, now seen corresponding path program 9 times [2019-12-07 19:04:52,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:52,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563240510] [2019-12-07 19:04:52,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:53,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563240510] [2019-12-07 19:04:53,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:53,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 19:04:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171887891] [2019-12-07 19:04:53,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:04:53,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:04:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:04:53,219 INFO L87 Difference]: Start difference. First operand 12098 states and 35906 transitions. Second operand 16 states. [2019-12-07 19:04:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:55,086 INFO L93 Difference]: Finished difference Result 17378 states and 50401 transitions. [2019-12-07 19:04:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 19:04:55,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 19:04:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:55,101 INFO L225 Difference]: With dead ends: 17378 [2019-12-07 19:04:55,101 INFO L226 Difference]: Without dead ends: 13746 [2019-12-07 19:04:55,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=497, Invalid=2583, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 19:04:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2019-12-07 19:04:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 11566. [2019-12-07 19:04:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-07 19:04:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 34434 transitions. [2019-12-07 19:04:55,276 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 34434 transitions. Word has length 56 [2019-12-07 19:04:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:55,277 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 34434 transitions. [2019-12-07 19:04:55,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:04:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 34434 transitions. [2019-12-07 19:04:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:55,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:55,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:55,287 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2085383710, now seen corresponding path program 10 times [2019-12-07 19:04:55,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:55,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523101596] [2019-12-07 19:04:55,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:55,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523101596] [2019-12-07 19:04:55,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:55,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 19:04:55,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980777423] [2019-12-07 19:04:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:04:55,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:04:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:04:55,597 INFO L87 Difference]: Start difference. First operand 11566 states and 34434 transitions. Second operand 16 states. [2019-12-07 19:04:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:58,068 INFO L93 Difference]: Finished difference Result 14601 states and 42757 transitions. [2019-12-07 19:04:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 19:04:58,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-07 19:04:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:58,082 INFO L225 Difference]: With dead ends: 14601 [2019-12-07 19:04:58,082 INFO L226 Difference]: Without dead ends: 12993 [2019-12-07 19:04:58,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 19:04:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12993 states. [2019-12-07 19:04:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12993 to 11748. [2019-12-07 19:04:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11748 states. [2019-12-07 19:04:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11748 states to 11748 states and 34876 transitions. [2019-12-07 19:04:58,249 INFO L78 Accepts]: Start accepts. Automaton has 11748 states and 34876 transitions. Word has length 56 [2019-12-07 19:04:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:58,249 INFO L462 AbstractCegarLoop]: Abstraction has 11748 states and 34876 transitions. [2019-12-07 19:04:58,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:04:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 11748 states and 34876 transitions. [2019-12-07 19:04:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:58,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:58,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:58,259 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -392966444, now seen corresponding path program 11 times [2019-12-07 19:04:58,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:58,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101812115] [2019-12-07 19:04:58,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:58,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101812115] [2019-12-07 19:04:58,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:58,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:04:58,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737875861] [2019-12-07 19:04:58,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:04:58,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:04:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:04:58,367 INFO L87 Difference]: Start difference. First operand 11748 states and 34876 transitions. Second operand 11 states. [2019-12-07 19:04:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:04:58,760 INFO L93 Difference]: Finished difference Result 13080 states and 38226 transitions. [2019-12-07 19:04:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 19:04:58,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 19:04:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:04:58,771 INFO L225 Difference]: With dead ends: 13080 [2019-12-07 19:04:58,771 INFO L226 Difference]: Without dead ends: 9560 [2019-12-07 19:04:58,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-07 19:04:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9560 states. [2019-12-07 19:04:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9560 to 8442. [2019-12-07 19:04:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8442 states. [2019-12-07 19:04:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8442 states to 8442 states and 24978 transitions. [2019-12-07 19:04:58,893 INFO L78 Accepts]: Start accepts. Automaton has 8442 states and 24978 transitions. Word has length 56 [2019-12-07 19:04:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:04:58,893 INFO L462 AbstractCegarLoop]: Abstraction has 8442 states and 24978 transitions. [2019-12-07 19:04:58,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:04:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 8442 states and 24978 transitions. [2019-12-07 19:04:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:04:58,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:04:58,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:04:58,900 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:04:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:04:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 12 times [2019-12-07 19:04:58,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:04:58,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850331384] [2019-12-07 19:04:58,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:04:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:04:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:04:59,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850331384] [2019-12-07 19:04:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:04:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 19:04:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325006118] [2019-12-07 19:04:59,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 19:04:59,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:04:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 19:04:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:04:59,160 INFO L87 Difference]: Start difference. First operand 8442 states and 24978 transitions. Second operand 15 states. [2019-12-07 19:05:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:02,155 INFO L93 Difference]: Finished difference Result 10485 states and 30233 transitions. [2019-12-07 19:05:02,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-07 19:05:02,156 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 19:05:02,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:02,165 INFO L225 Difference]: With dead ends: 10485 [2019-12-07 19:05:02,165 INFO L226 Difference]: Without dead ends: 9836 [2019-12-07 19:05:02,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=772, Invalid=4484, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 19:05:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9836 states. [2019-12-07 19:05:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9836 to 8248. [2019-12-07 19:05:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8248 states. [2019-12-07 19:05:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8248 states to 8248 states and 24500 transitions. [2019-12-07 19:05:02,286 INFO L78 Accepts]: Start accepts. Automaton has 8248 states and 24500 transitions. Word has length 56 [2019-12-07 19:05:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:02,286 INFO L462 AbstractCegarLoop]: Abstraction has 8248 states and 24500 transitions. [2019-12-07 19:05:02,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 19:05:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 8248 states and 24500 transitions. [2019-12-07 19:05:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:05:02,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:02,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:05:02,293 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:02,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 13 times [2019-12-07 19:05:02,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:02,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528345537] [2019-12-07 19:05:02,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:05:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:05:02,358 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:05:02,358 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:05:02,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26|) |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1906~0.base_26|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26| 1) |v_#valid_62|) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ULTIMATE.start_main_~#t1906~0.offset=|v_ULTIMATE.start_main_~#t1906~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ULTIMATE.start_main_~#t1906~0.base=|v_ULTIMATE.start_main_~#t1906~0.base_26|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1907~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1908~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t1906~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1906~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1907~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1908~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:05:02,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1907~0.base_10|) (= |v_ULTIMATE.start_main_~#t1907~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10|) |v_ULTIMATE.start_main_~#t1907~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1907~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1907~0.base, #length] because there is no mapped edge [2019-12-07 19:05:02,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:05:02,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11| 1) |v_#valid_27|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| 4) |v_#length_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11|) |v_ULTIMATE.start_main_~#t1908~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1908~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1908~0.base_11|) (= |v_ULTIMATE.start_main_~#t1908~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1908~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1908~0.offset] because there is no mapped edge [2019-12-07 19:05:02,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1652317783 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1652317783 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1652317783| ~x~0_In-1652317783)) (and (not .cse1) (= ~x$w_buff1~0_In-1652317783 |P2Thread1of1ForFork1_#t~ite32_Out-1652317783|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1652317783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1652317783, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1652317783, ~x~0=~x~0_In-1652317783} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1652317783|, ~x$w_buff1~0=~x$w_buff1~0_In-1652317783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1652317783, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1652317783, ~x~0=~x~0_In-1652317783} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:05:02,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In292195952 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In292195952 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out292195952|)) (and (= ~x$w_buff0_used~0_In292195952 |P2Thread1of1ForFork1_#t~ite34_Out292195952|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In292195952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In292195952} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out292195952|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In292195952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In292195952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:05:02,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In83097403 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In83097403| |P0Thread1of1ForFork2_#t~ite8_Out83097403|) (= ~x$w_buff0~0_In83097403 |P0Thread1of1ForFork2_#t~ite9_Out83097403|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out83097403| |P0Thread1of1ForFork2_#t~ite8_Out83097403|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In83097403 256)))) (or (= (mod ~x$w_buff0_used~0_In83097403 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In83097403 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In83097403 256) 0) .cse1))) (= ~x$w_buff0~0_In83097403 |P0Thread1of1ForFork2_#t~ite8_Out83097403|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In83097403, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In83097403, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In83097403|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In83097403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In83097403, ~weak$$choice2~0=~weak$$choice2~0_In83097403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In83097403} OutVars{~x$w_buff0~0=~x$w_buff0~0_In83097403, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In83097403, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out83097403|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In83097403, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out83097403|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In83097403, ~weak$$choice2~0=~weak$$choice2~0_In83097403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In83097403} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:05:02,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2058865919 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2058865919 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out2058865919|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2058865919 |P1Thread1of1ForFork0_#t~ite28_Out2058865919|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2058865919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058865919} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2058865919, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2058865919|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058865919} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:05:02,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1190781267 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1190781267 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1190781267 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1190781267 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1190781267| ~x$w_buff1_used~0_In-1190781267)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1190781267| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1190781267, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1190781267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1190781267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1190781267} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1190781267, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1190781267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1190781267, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1190781267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1190781267} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:05:02,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2128034327 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2128034327 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-2128034327 ~x$r_buff0_thd2~0_In-2128034327))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-2128034327 0)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2128034327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128034327} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2128034327|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2128034327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128034327} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:05:02,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In491331165 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In491331165 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In491331165 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In491331165 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out491331165| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out491331165| ~x$r_buff1_thd2~0_In491331165) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491331165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491331165, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491331165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491331165} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out491331165|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In491331165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491331165, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491331165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491331165} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:05:02,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:05:02,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-507988023 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-507988023 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-507988023 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-507988023 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-507988023 |P2Thread1of1ForFork1_#t~ite35_Out-507988023|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out-507988023| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-507988023, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-507988023, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-507988023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507988023} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-507988023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-507988023, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-507988023, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-507988023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507988023} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:05:02,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1818467721 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1818467721 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In1818467721 |P2Thread1of1ForFork1_#t~ite36_Out1818467721|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1818467721|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1818467721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818467721} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1818467721|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1818467721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818467721} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:05:02,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-329605560 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-329605560 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-329605560 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-329605560 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-329605560 256) 0) .cse0))) (= ~x$w_buff1_used~0_In-329605560 |P0Thread1of1ForFork2_#t~ite17_Out-329605560|) .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-329605560| |P0Thread1of1ForFork2_#t~ite18_Out-329605560|)) (and (= ~x$w_buff1_used~0_In-329605560 |P0Thread1of1ForFork2_#t~ite18_Out-329605560|) (= |P0Thread1of1ForFork2_#t~ite17_In-329605560| |P0Thread1of1ForFork2_#t~ite17_Out-329605560|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329605560, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-329605560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-329605560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-329605560, ~weak$$choice2~0=~weak$$choice2~0_In-329605560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329605560} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329605560, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-329605560|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-329605560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-329605560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-329605560, ~weak$$choice2~0=~weak$$choice2~0_In-329605560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329605560} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:05:02,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:05:02,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1094896954 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1094896954| |P0Thread1of1ForFork2_#t~ite24_Out-1094896954|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1094896954 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1094896954 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1094896954 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1094896954 256))))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-1094896954| ~x$r_buff1_thd1~0_In-1094896954)) (and (not .cse1) (= ~x$r_buff1_thd1~0_In-1094896954 |P0Thread1of1ForFork2_#t~ite24_Out-1094896954|) (= |P0Thread1of1ForFork2_#t~ite23_In-1094896954| |P0Thread1of1ForFork2_#t~ite23_Out-1094896954|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1094896954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094896954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1094896954, ~weak$$choice2~0=~weak$$choice2~0_In-1094896954, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1094896954|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1094896954} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1094896954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094896954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1094896954, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1094896954|, ~weak$$choice2~0=~weak$$choice2~0_In-1094896954, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1094896954|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1094896954} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In713606728 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In713606728 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In713606728 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In713606728 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out713606728| ~x$r_buff1_thd3~0_In713606728)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out713606728| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In713606728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In713606728, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In713606728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In713606728} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out713606728|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In713606728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In713606728, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In713606728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In713606728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1748454920 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1748454920 256) 0))) (or (and (= ~x$w_buff1~0_In-1748454920 |ULTIMATE.start_main_#t~ite41_Out-1748454920|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1748454920| ~x~0_In-1748454920) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1748454920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1748454920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1748454920, ~x~0=~x~0_In-1748454920} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1748454920|, ~x$w_buff1~0=~x$w_buff1~0_In-1748454920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1748454920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1748454920, ~x~0=~x~0_In-1748454920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In780360047 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In780360047 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out780360047|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out780360047| ~x$w_buff0_used~0_In780360047) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In780360047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780360047} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In780360047, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out780360047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780360047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:05:02,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-160901119 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-160901119 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-160901119 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-160901119 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-160901119 |ULTIMATE.start_main_#t~ite44_Out-160901119|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-160901119|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160901119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160901119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160901119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160901119} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160901119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160901119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160901119, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-160901119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160901119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:05:02,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-746048687 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-746048687 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-746048687|)) (and (= ~x$r_buff0_thd0~0_In-746048687 |ULTIMATE.start_main_#t~ite45_Out-746048687|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746048687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746048687} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746048687, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746048687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746048687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:05:02,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1230004476 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1230004476 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1230004476 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1230004476 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1230004476|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-1230004476 |ULTIMATE.start_main_#t~ite46_Out-1230004476|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1230004476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1230004476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1230004476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1230004476} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1230004476, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1230004476|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1230004476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1230004476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1230004476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:05:02,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:05:02,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:05:02 BasicIcfg [2019-12-07 19:05:02,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:05:02,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:05:02,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:05:02,421 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:05:02,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:03:51" (3/4) ... [2019-12-07 19:05:02,422 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:05:02,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1906~0.base_26|) |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= |v_ULTIMATE.start_main_~#t1906~0.offset_20| 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1906~0.base_26|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26| 1) |v_#valid_62|) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_#NULL.base_5|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1906~0.base_26|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1906~0.base_26| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ULTIMATE.start_main_~#t1906~0.offset=|v_ULTIMATE.start_main_~#t1906~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ULTIMATE.start_main_~#t1906~0.base=|v_ULTIMATE.start_main_~#t1906~0.base_26|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_20|, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1907~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1908~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t1906~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t1906~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1907~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1908~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:05:02,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1907~0.base_10|) (= |v_ULTIMATE.start_main_~#t1907~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1907~0.base_10|) |v_ULTIMATE.start_main_~#t1907~0.offset_9| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1907~0.base_10|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1907~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1907~0.offset=|v_ULTIMATE.start_main_~#t1907~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1907~0.base=|v_ULTIMATE.start_main_~#t1907~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1907~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1907~0.base, #length] because there is no mapped edge [2019-12-07 19:05:02,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_45 256) 0)) (not (= (mod v_~x$w_buff0_used~0_82 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= 1 v_~x$w_buff0~0_22)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 19:05:02,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11| 1) |v_#valid_27|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| 4) |v_#length_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1908~0.base_11|) |v_ULTIMATE.start_main_~#t1908~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1908~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1908~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1908~0.base_11|) (= |v_ULTIMATE.start_main_~#t1908~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1908~0.base=|v_ULTIMATE.start_main_~#t1908~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1908~0.offset=|v_ULTIMATE.start_main_~#t1908~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1908~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1908~0.offset] because there is no mapped edge [2019-12-07 19:05:02,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1652317783 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1652317783 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1652317783| ~x~0_In-1652317783)) (and (not .cse1) (= ~x$w_buff1~0_In-1652317783 |P2Thread1of1ForFork1_#t~ite32_Out-1652317783|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1652317783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1652317783, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1652317783, ~x~0=~x~0_In-1652317783} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1652317783|, ~x$w_buff1~0=~x$w_buff1~0_In-1652317783, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1652317783, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1652317783, ~x~0=~x~0_In-1652317783} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:05:02,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_6|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_6|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_5|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In292195952 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In292195952 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out292195952|)) (and (= ~x$w_buff0_used~0_In292195952 |P2Thread1of1ForFork1_#t~ite34_Out292195952|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In292195952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In292195952} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out292195952|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In292195952, ~x$w_buff0_used~0=~x$w_buff0_used~0_In292195952} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:05:02,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In83097403 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In83097403| |P0Thread1of1ForFork2_#t~ite8_Out83097403|) (= ~x$w_buff0~0_In83097403 |P0Thread1of1ForFork2_#t~ite9_Out83097403|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out83097403| |P0Thread1of1ForFork2_#t~ite8_Out83097403|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In83097403 256)))) (or (= (mod ~x$w_buff0_used~0_In83097403 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In83097403 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In83097403 256) 0) .cse1))) (= ~x$w_buff0~0_In83097403 |P0Thread1of1ForFork2_#t~ite8_Out83097403|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In83097403, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In83097403, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In83097403|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In83097403, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In83097403, ~weak$$choice2~0=~weak$$choice2~0_In83097403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In83097403} OutVars{~x$w_buff0~0=~x$w_buff0~0_In83097403, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In83097403, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out83097403|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In83097403, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out83097403|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In83097403, ~weak$$choice2~0=~weak$$choice2~0_In83097403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In83097403} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 19:05:02,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2058865919 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2058865919 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out2058865919|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In2058865919 |P1Thread1of1ForFork0_#t~ite28_Out2058865919|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2058865919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058865919} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2058865919, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out2058865919|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2058865919} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:05:02,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1190781267 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1190781267 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1190781267 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1190781267 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1190781267| ~x$w_buff1_used~0_In-1190781267)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1190781267| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1190781267, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1190781267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1190781267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1190781267} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1190781267, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1190781267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1190781267, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1190781267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1190781267} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:05:02,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2128034327 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2128034327 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-2128034327 ~x$r_buff0_thd2~0_In-2128034327))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-2128034327 0)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2128034327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128034327} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2128034327|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2128034327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2128034327} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:05:02,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In491331165 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In491331165 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In491331165 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In491331165 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out491331165| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out491331165| ~x$r_buff1_thd2~0_In491331165) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491331165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491331165, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491331165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491331165} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out491331165|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In491331165, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In491331165, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In491331165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491331165} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:05:02,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:05:02,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-507988023 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-507988023 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-507988023 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-507988023 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-507988023 |P2Thread1of1ForFork1_#t~ite35_Out-507988023|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite35_Out-507988023| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-507988023, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-507988023, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-507988023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507988023} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-507988023|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-507988023, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-507988023, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-507988023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-507988023} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:05:02,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1818467721 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1818467721 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In1818467721 |P2Thread1of1ForFork1_#t~ite36_Out1818467721|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1818467721|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1818467721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818467721} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1818467721|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1818467721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1818467721} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-329605560 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-329605560 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-329605560 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-329605560 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-329605560 256) 0) .cse0))) (= ~x$w_buff1_used~0_In-329605560 |P0Thread1of1ForFork2_#t~ite17_Out-329605560|) .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-329605560| |P0Thread1of1ForFork2_#t~ite18_Out-329605560|)) (and (= ~x$w_buff1_used~0_In-329605560 |P0Thread1of1ForFork2_#t~ite18_Out-329605560|) (= |P0Thread1of1ForFork2_#t~ite17_In-329605560| |P0Thread1of1ForFork2_#t~ite17_Out-329605560|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329605560, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-329605560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-329605560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-329605560, ~weak$$choice2~0=~weak$$choice2~0_In-329605560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329605560} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329605560, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-329605560|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-329605560|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-329605560, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-329605560, ~weak$$choice2~0=~weak$$choice2~0_In-329605560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329605560} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1094896954 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1094896954| |P0Thread1of1ForFork2_#t~ite24_Out-1094896954|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1094896954 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1094896954 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1094896954 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1094896954 256))))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-1094896954| ~x$r_buff1_thd1~0_In-1094896954)) (and (not .cse1) (= ~x$r_buff1_thd1~0_In-1094896954 |P0Thread1of1ForFork2_#t~ite24_Out-1094896954|) (= |P0Thread1of1ForFork2_#t~ite23_In-1094896954| |P0Thread1of1ForFork2_#t~ite23_Out-1094896954|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1094896954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094896954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1094896954, ~weak$$choice2~0=~weak$$choice2~0_In-1094896954, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1094896954|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1094896954} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1094896954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094896954, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1094896954, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1094896954|, ~weak$$choice2~0=~weak$$choice2~0_In-1094896954, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1094896954|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1094896954} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In713606728 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In713606728 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In713606728 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In713606728 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out713606728| ~x$r_buff1_thd3~0_In713606728)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out713606728| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In713606728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In713606728, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In713606728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In713606728} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out713606728|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In713606728, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In713606728, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In713606728, ~x$w_buff0_used~0=~x$w_buff0_used~0_In713606728} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:05:02,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 19:05:02,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1748454920 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1748454920 256) 0))) (or (and (= ~x$w_buff1~0_In-1748454920 |ULTIMATE.start_main_#t~ite41_Out-1748454920|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1748454920| ~x~0_In-1748454920) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1748454920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1748454920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1748454920, ~x~0=~x~0_In-1748454920} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1748454920|, ~x$w_buff1~0=~x$w_buff1~0_In-1748454920, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1748454920, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1748454920, ~x~0=~x~0_In-1748454920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:05:02,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 19:05:02,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In780360047 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In780360047 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out780360047|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out780360047| ~x$w_buff0_used~0_In780360047) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In780360047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780360047} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In780360047, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out780360047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780360047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:05:02,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-160901119 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-160901119 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-160901119 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-160901119 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-160901119 |ULTIMATE.start_main_#t~ite44_Out-160901119|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite44_Out-160901119|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160901119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160901119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160901119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160901119} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-160901119, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-160901119, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-160901119, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-160901119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-160901119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:05:02,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-746048687 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-746048687 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-746048687|)) (and (= ~x$r_buff0_thd0~0_In-746048687 |ULTIMATE.start_main_#t~ite45_Out-746048687|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746048687, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746048687} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746048687, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-746048687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746048687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:05:02,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1230004476 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1230004476 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1230004476 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1230004476 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-1230004476|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-1230004476 |ULTIMATE.start_main_#t~ite46_Out-1230004476|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1230004476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1230004476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1230004476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1230004476} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1230004476, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1230004476|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1230004476, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1230004476, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1230004476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:05:02,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 (ite (= 0 (ite (not (and (= v_~y~0_272 2) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:05:02,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_223d5663-49e1-496c-8a06-705982c3a951/bin/utaipan/witness.graphml [2019-12-07 19:05:02,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:05:02,498 INFO L168 Benchmark]: Toolchain (without parser) took 72166.41 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 934.4 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,498 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:05:02,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,499 INFO L168 Benchmark]: Boogie Preprocessor took 23.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:05:02,499 INFO L168 Benchmark]: RCFGBuilder took 389.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,500 INFO L168 Benchmark]: TraceAbstraction took 71271.81 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,500 INFO L168 Benchmark]: Witness Printer took 75.86 ms. Allocated memory is still 5.0 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:02,502 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71271.81 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 75.86 ms. Allocated memory is still 5.0 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 71.1s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7167 SDtfs, 13671 SDslu, 26867 SDs, 0 SdLazy, 23623 SolverSat, 841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 738 GetRequests, 76 SyntacticMatches, 35 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5456 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 210588 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1719 NumberOfCodeBlocks, 1719 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1624 ConstructedInterpolants, 0 QuantifiedInterpolants, 489103 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...