./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8330f9f9701f7ebea9b135cd397af68bb8db1cbe ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-11-15 22:26:13,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:26:13,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:26:13,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:26:13,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:26:13,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:26:13,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:26:13,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:26:13,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:26:13,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:26:13,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:26:13,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:26:13,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:26:13,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:26:13,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:26:13,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:26:13,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:26:13,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:26:13,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:26:13,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:26:13,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:26:13,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:26:13,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:26:13,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:26:13,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:26:13,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:26:13,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:26:13,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:26:13,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:26:13,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:26:13,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:26:13,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:26:13,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:26:13,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:26:13,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:26:13,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:26:13,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:26:13,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:26:13,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:26:13,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:26:13,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:26:13,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:26:13,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:26:13,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:26:13,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:26:13,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:26:13,838 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:26:13,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:26:13,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:26:13,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:26:13,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:26:13,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:26:13,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:26:13,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:26:13,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:26:13,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:26:13,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:26:13,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:26:13,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:26:13,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:26:13,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:26:13,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:26:13,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:26:13,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:13,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:26:13,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:26:13,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:26:13,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:26:13,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:26:13,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:26:13,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8330f9f9701f7ebea9b135cd397af68bb8db1cbe [2019-11-15 22:26:13,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:26:13,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:26:13,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:26:13,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:26:13,892 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:26:13,894 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i [2019-11-15 22:26:13,970 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/data/adac4bb28/0f8e681fcd824f99b96631d34a69f156/FLAGedb747a90 [2019-11-15 22:26:14,484 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:26:14,485 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/sv-benchmarks/c/pthread-wmm/rfi004_tso.oepc.i [2019-11-15 22:26:14,499 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/data/adac4bb28/0f8e681fcd824f99b96631d34a69f156/FLAGedb747a90 [2019-11-15 22:26:14,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/data/adac4bb28/0f8e681fcd824f99b96631d34a69f156 [2019-11-15 22:26:14,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:26:14,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:26:14,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:14,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:26:14,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:26:14,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:14" (1/1) ... [2019-11-15 22:26:14,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772c77b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:14, skipping insertion in model container [2019-11-15 22:26:14,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:26:14" (1/1) ... [2019-11-15 22:26:14,730 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:26:14,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:26:15,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:15,254 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:26:15,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:26:15,397 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:26:15,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15 WrapperNode [2019-11-15 22:26:15,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:26:15,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:15,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:26:15,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:26:15,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:26:15,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:26:15,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:26:15,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:26:15,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... [2019-11-15 22:26:15,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:26:15,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:26:15,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:26:15,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:26:15,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:26:15,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:26:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:26:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:26:15,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:26:15,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:26:15,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:26:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:26:15,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:26:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:26:15,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:26:15,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:26:15,598 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 22:26:16,236 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:26:16,237 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:26:16,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:16 BoogieIcfgContainer [2019-11-15 22:26:16,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:26:16,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:26:16,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:26:16,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:26:16,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:26:14" (1/3) ... [2019-11-15 22:26:16,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6360a176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:16, skipping insertion in model container [2019-11-15 22:26:16,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:26:15" (2/3) ... [2019-11-15 22:26:16,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6360a176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:26:16, skipping insertion in model container [2019-11-15 22:26:16,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:16" (3/3) ... [2019-11-15 22:26:16,246 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-11-15 22:26:16,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,305 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,305 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,306 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,306 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,307 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,308 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,309 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,310 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,311 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,312 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,313 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,314 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,315 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,316 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,317 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,318 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,319 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,320 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,321 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,322 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,323 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,324 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,325 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,326 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,327 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,328 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,328 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,328 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,329 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,329 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,330 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,333 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,333 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,334 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,335 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,336 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,344 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,344 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,345 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,346 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,347 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,347 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,347 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:26:16,355 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:26:16,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:26:16,363 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:26:16,374 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:26:16,395 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:26:16,395 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:26:16,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:26:16,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:26:16,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:26:16,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:26:16,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:26:16,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:26:16,416 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 162 transitions [2019-11-15 22:26:18,699 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-15 22:26:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-15 22:26:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 22:26:18,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:18,711 INFO L380 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-11-15 22:26:18,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:18,719 INFO L82 PathProgramCache]: Analyzing trace with hash 607370489, now seen corresponding path program 1 times [2019-11-15 22:26:18,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:18,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959498059] [2019-11-15 22:26:18,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:18,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:18,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:19,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959498059] [2019-11-15 22:26:19,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:19,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:19,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670946319] [2019-11-15 22:26:19,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:19,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:19,077 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-15 22:26:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:19,767 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-15 22:26:19,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:19,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 22:26:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:20,018 INFO L225 Difference]: With dead ends: 26616 [2019-11-15 22:26:20,018 INFO L226 Difference]: Without dead ends: 20360 [2019-11-15 22:26:20,021 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-15 22:26:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-15 22:26:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-15 22:26:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-15 22:26:21,449 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-15 22:26:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:21,450 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-15 22:26:21,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-15 22:26:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:26:21,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:21,463 INFO L380 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] [2019-11-15 22:26:21,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash -885351668, now seen corresponding path program 1 times [2019-11-15 22:26:21,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:21,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446404894] [2019-11-15 22:26:21,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:21,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:21,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:21,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446404894] [2019-11-15 22:26:21,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:21,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:21,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301514881] [2019-11-15 22:26:21,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:21,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:21,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:21,607 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-15 22:26:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:22,935 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-15 22:26:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:22,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 22:26:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:23,103 INFO L225 Difference]: With dead ends: 31838 [2019-11-15 22:26:23,103 INFO L226 Difference]: Without dead ends: 31286 [2019-11-15 22:26:23,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-15 22:26:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-15 22:26:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-15 22:26:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-15 22:26:24,703 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-15 22:26:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:24,705 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-15 22:26:24,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-15 22:26:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:26:24,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:24,713 INFO L380 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] [2019-11-15 22:26:24,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1873873386, now seen corresponding path program 1 times [2019-11-15 22:26:24,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:24,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991427841] [2019-11-15 22:26:24,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:24,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:24,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:24,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991427841] [2019-11-15 22:26:24,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:24,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:24,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016961588] [2019-11-15 22:26:24,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:24,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:24,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:24,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:24,856 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-15 22:26:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:25,889 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-15 22:26:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:25,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 22:26:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:26,063 INFO L225 Difference]: With dead ends: 38696 [2019-11-15 22:26:26,063 INFO L226 Difference]: Without dead ends: 38248 [2019-11-15 22:26:26,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-15 22:26:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-15 22:26:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-15 22:26:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-15 22:26:27,149 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-15 22:26:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:27,150 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-15 22:26:27,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-15 22:26:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:26:27,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:27,662 INFO L380 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] [2019-11-15 22:26:27,662 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -317500932, now seen corresponding path program 1 times [2019-11-15 22:26:27,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:27,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073294930] [2019-11-15 22:26:27,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:27,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:27,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:27,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073294930] [2019-11-15 22:26:27,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:27,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:26:27,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47812210] [2019-11-15 22:26:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:26:27,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:26:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:26:27,747 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-15 22:26:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:27,990 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-15 22:26:27,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:26:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 22:26:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:28,155 INFO L225 Difference]: With dead ends: 42412 [2019-11-15 22:26:28,155 INFO L226 Difference]: Without dead ends: 42412 [2019-11-15 22:26:28,156 INFO L600 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-11-15 22:26:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-15 22:26:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-15 22:26:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-15 22:26:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-15 22:26:29,291 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-15 22:26:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:29,292 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-15 22:26:29,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:26:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-15 22:26:29,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:26:29,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:29,313 INFO L380 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-11-15 22:26:29,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 259150685, now seen corresponding path program 1 times [2019-11-15 22:26:29,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:29,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860833136] [2019-11-15 22:26:29,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:29,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:29,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-11-15 22:26:29,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860833136] [2019-11-15 22:26:29,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:29,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:29,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127470148] [2019-11-15 22:26:29,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:29,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:29,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:29,449 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-15 22:26:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:30,833 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-15 22:26:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:26:30,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:26:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:30,936 INFO L225 Difference]: With dead ends: 48756 [2019-11-15 22:26:30,936 INFO L226 Difference]: Without dead ends: 48236 [2019-11-15 22:26:30,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:26:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-15 22:26:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-15 22:26:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-15 22:26:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-15 22:26:31,805 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-15 22:26:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:31,806 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-15 22:26:31,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-15 22:26:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:26:31,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:31,830 INFO L380 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-11-15 22:26:31,830 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1550627923, now seen corresponding path program 1 times [2019-11-15 22:26:31,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:31,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641985189] [2019-11-15 22:26:31,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:31,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:31,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:31,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641985189] [2019-11-15 22:26:31,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:31,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:31,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474641737] [2019-11-15 22:26:31,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:31,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:31,969 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 6 states. [2019-11-15 22:26:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:32,765 INFO L93 Difference]: Finished difference Result 53005 states and 189571 transitions. [2019-11-15 22:26:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:32,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 22:26:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:32,885 INFO L225 Difference]: With dead ends: 53005 [2019-11-15 22:26:32,885 INFO L226 Difference]: Without dead ends: 52029 [2019-11-15 22:26:32,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-15 22:26:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 48782. [2019-11-15 22:26:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-15 22:26:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-15 22:26:34,233 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-15 22:26:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:34,233 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-15 22:26:34,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-15 22:26:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:26:34,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:34,249 INFO L380 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-11-15 22:26:34,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 947388014, now seen corresponding path program 1 times [2019-11-15 22:26:34,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:34,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572254081] [2019-11-15 22:26:34,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:34,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:34,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:34,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572254081] [2019-11-15 22:26:34,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:34,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:26:34,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563017062] [2019-11-15 22:26:34,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:26:34,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:26:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:26:34,364 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-15 22:26:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:35,456 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-15 22:26:35,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:26:35,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 22:26:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:35,599 INFO L225 Difference]: With dead ends: 70897 [2019-11-15 22:26:35,599 INFO L226 Difference]: Without dead ends: 70897 [2019-11-15 22:26:35,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:26:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-15 22:26:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-15 22:26:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-15 22:26:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-15 22:26:37,120 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-15 22:26:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:37,120 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-15 22:26:37,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:26:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-15 22:26:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:26:37,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:37,133 INFO L380 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-11-15 22:26:37,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1834891695, now seen corresponding path program 1 times [2019-11-15 22:26:37,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:37,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624076903] [2019-11-15 22:26:37,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:37,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624076903] [2019-11-15 22:26:37,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:37,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:37,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712641630] [2019-11-15 22:26:37,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:37,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:37,206 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 4 states. [2019-11-15 22:26:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:37,275 INFO L93 Difference]: Finished difference Result 10860 states and 33395 transitions. [2019-11-15 22:26:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:26:37,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-15 22:26:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:37,292 INFO L225 Difference]: With dead ends: 10860 [2019-11-15 22:26:37,293 INFO L226 Difference]: Without dead ends: 9361 [2019-11-15 22:26:37,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-15 22:26:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9361 states. [2019-11-15 22:26:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9361 to 9313. [2019-11-15 22:26:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9313 states. [2019-11-15 22:26:37,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9313 states to 9313 states and 28345 transitions. [2019-11-15 22:26:37,448 INFO L78 Accepts]: Start accepts. Automaton has 9313 states and 28345 transitions. Word has length 54 [2019-11-15 22:26:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:37,448 INFO L462 AbstractCegarLoop]: Abstraction has 9313 states and 28345 transitions. [2019-11-15 22:26:37,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9313 states and 28345 transitions. [2019-11-15 22:26:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:26:37,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:37,455 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:37,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -345267242, now seen corresponding path program 1 times [2019-11-15 22:26:37,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:37,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029965249] [2019-11-15 22:26:37,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:37,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029965249] [2019-11-15 22:26:37,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:37,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:37,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837344820] [2019-11-15 22:26:37,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:37,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:37,515 INFO L87 Difference]: Start difference. First operand 9313 states and 28345 transitions. Second operand 4 states. [2019-11-15 22:26:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:37,682 INFO L93 Difference]: Finished difference Result 10888 states and 33037 transitions. [2019-11-15 22:26:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:26:37,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 22:26:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:37,700 INFO L225 Difference]: With dead ends: 10888 [2019-11-15 22:26:37,700 INFO L226 Difference]: Without dead ends: 10888 [2019-11-15 22:26:37,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-15 22:26:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10888 states. [2019-11-15 22:26:37,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10888 to 9880. [2019-11-15 22:26:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9880 states. [2019-11-15 22:26:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9880 states to 9880 states and 30016 transitions. [2019-11-15 22:26:37,849 INFO L78 Accepts]: Start accepts. Automaton has 9880 states and 30016 transitions. Word has length 64 [2019-11-15 22:26:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:37,849 INFO L462 AbstractCegarLoop]: Abstraction has 9880 states and 30016 transitions. [2019-11-15 22:26:37,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 9880 states and 30016 transitions. [2019-11-15 22:26:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:26:37,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:37,855 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:37,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1397543093, now seen corresponding path program 1 times [2019-11-15 22:26:37,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:37,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569331658] [2019-11-15 22:26:37,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:37,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:37,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569331658] [2019-11-15 22:26:37,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:37,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:37,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916691823] [2019-11-15 22:26:37,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:37,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:37,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:37,941 INFO L87 Difference]: Start difference. First operand 9880 states and 30016 transitions. Second operand 6 states. [2019-11-15 22:26:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:38,448 INFO L93 Difference]: Finished difference Result 12786 states and 38226 transitions. [2019-11-15 22:26:38,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:26:38,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 22:26:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:38,470 INFO L225 Difference]: With dead ends: 12786 [2019-11-15 22:26:38,471 INFO L226 Difference]: Without dead ends: 12738 [2019-11-15 22:26:38,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:26:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-11-15 22:26:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 10619. [2019-11-15 22:26:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10619 states. [2019-11-15 22:26:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10619 states to 10619 states and 32069 transitions. [2019-11-15 22:26:38,626 INFO L78 Accepts]: Start accepts. Automaton has 10619 states and 32069 transitions. Word has length 64 [2019-11-15 22:26:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:38,626 INFO L462 AbstractCegarLoop]: Abstraction has 10619 states and 32069 transitions. [2019-11-15 22:26:38,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 10619 states and 32069 transitions. [2019-11-15 22:26:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:26:38,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:38,634 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:38,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -960211393, now seen corresponding path program 1 times [2019-11-15 22:26:38,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:38,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207481155] [2019-11-15 22:26:38,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:38,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:38,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:38,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207481155] [2019-11-15 22:26:38,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:38,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:38,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430842521] [2019-11-15 22:26:38,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:38,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:38,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:38,693 INFO L87 Difference]: Start difference. First operand 10619 states and 32069 transitions. Second operand 4 states. [2019-11-15 22:26:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:38,961 INFO L93 Difference]: Finished difference Result 13321 states and 39671 transitions. [2019-11-15 22:26:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:38,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:26:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:38,978 INFO L225 Difference]: With dead ends: 13321 [2019-11-15 22:26:38,978 INFO L226 Difference]: Without dead ends: 13321 [2019-11-15 22:26:38,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13321 states. [2019-11-15 22:26:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13321 to 12175. [2019-11-15 22:26:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-11-15 22:26:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 36360 transitions. [2019-11-15 22:26:39,137 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 36360 transitions. Word has length 66 [2019-11-15 22:26:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:39,137 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 36360 transitions. [2019-11-15 22:26:39,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 36360 transitions. [2019-11-15 22:26:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:26:39,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:39,147 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:39,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1257546560, now seen corresponding path program 1 times [2019-11-15 22:26:39,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:39,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295861295] [2019-11-15 22:26:39,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:39,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:39,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:39,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295861295] [2019-11-15 22:26:39,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:39,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:26:39,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357333596] [2019-11-15 22:26:39,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:26:39,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:26:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:26:39,191 INFO L87 Difference]: Start difference. First operand 12175 states and 36360 transitions. Second operand 3 states. [2019-11-15 22:26:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:39,372 INFO L93 Difference]: Finished difference Result 12701 states and 37765 transitions. [2019-11-15 22:26:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:26:39,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 22:26:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:39,390 INFO L225 Difference]: With dead ends: 12701 [2019-11-15 22:26:39,390 INFO L226 Difference]: Without dead ends: 12701 [2019-11-15 22:26:39,390 INFO L600 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-11-15 22:26:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2019-11-15 22:26:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 12463. [2019-11-15 22:26:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12463 states. [2019-11-15 22:26:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12463 states to 12463 states and 37124 transitions. [2019-11-15 22:26:39,630 INFO L78 Accepts]: Start accepts. Automaton has 12463 states and 37124 transitions. Word has length 66 [2019-11-15 22:26:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:39,631 INFO L462 AbstractCegarLoop]: Abstraction has 12463 states and 37124 transitions. [2019-11-15 22:26:39,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:26:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12463 states and 37124 transitions. [2019-11-15 22:26:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:39,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:39,645 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:39,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash -749438172, now seen corresponding path program 1 times [2019-11-15 22:26:39,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:39,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140194281] [2019-11-15 22:26:39,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:39,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:39,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:39,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140194281] [2019-11-15 22:26:39,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:39,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:39,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598166916] [2019-11-15 22:26:39,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:39,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:39,757 INFO L87 Difference]: Start difference. First operand 12463 states and 37124 transitions. Second operand 6 states. [2019-11-15 22:26:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:40,221 INFO L93 Difference]: Finished difference Result 13734 states and 40363 transitions. [2019-11-15 22:26:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:40,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 22:26:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:40,240 INFO L225 Difference]: With dead ends: 13734 [2019-11-15 22:26:40,240 INFO L226 Difference]: Without dead ends: 13734 [2019-11-15 22:26:40,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2019-11-15 22:26:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 13248. [2019-11-15 22:26:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13248 states. [2019-11-15 22:26:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13248 states to 13248 states and 39079 transitions. [2019-11-15 22:26:40,415 INFO L78 Accepts]: Start accepts. Automaton has 13248 states and 39079 transitions. Word has length 68 [2019-11-15 22:26:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:40,415 INFO L462 AbstractCegarLoop]: Abstraction has 13248 states and 39079 transitions. [2019-11-15 22:26:40,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 13248 states and 39079 transitions. [2019-11-15 22:26:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:40,426 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:40,427 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:40,427 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:40,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1468319781, now seen corresponding path program 1 times [2019-11-15 22:26:40,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:40,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831370241] [2019-11-15 22:26:40,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:40,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:40,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:40,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831370241] [2019-11-15 22:26:40,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:40,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:40,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173451468] [2019-11-15 22:26:40,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:40,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:40,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:40,521 INFO L87 Difference]: Start difference. First operand 13248 states and 39079 transitions. Second operand 6 states. [2019-11-15 22:26:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:40,920 INFO L93 Difference]: Finished difference Result 15571 states and 44589 transitions. [2019-11-15 22:26:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:26:40,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 22:26:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:40,947 INFO L225 Difference]: With dead ends: 15571 [2019-11-15 22:26:40,947 INFO L226 Difference]: Without dead ends: 15571 [2019-11-15 22:26:40,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:26:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15571 states. [2019-11-15 22:26:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15571 to 13822. [2019-11-15 22:26:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-11-15 22:26:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 39929 transitions. [2019-11-15 22:26:41,211 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 39929 transitions. Word has length 68 [2019-11-15 22:26:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:41,211 INFO L462 AbstractCegarLoop]: Abstraction has 13822 states and 39929 transitions. [2019-11-15 22:26:41,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 39929 transitions. [2019-11-15 22:26:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:41,228 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:41,228 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:41,229 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1679670694, now seen corresponding path program 1 times [2019-11-15 22:26:41,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:41,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820921748] [2019-11-15 22:26:41,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:41,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820921748] [2019-11-15 22:26:41,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:41,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:41,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519436071] [2019-11-15 22:26:41,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:41,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:41,311 INFO L87 Difference]: Start difference. First operand 13822 states and 39929 transitions. Second operand 5 states. [2019-11-15 22:26:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:41,633 INFO L93 Difference]: Finished difference Result 17383 states and 50008 transitions. [2019-11-15 22:26:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:26:41,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:26:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:41,658 INFO L225 Difference]: With dead ends: 17383 [2019-11-15 22:26:41,658 INFO L226 Difference]: Without dead ends: 17383 [2019-11-15 22:26:41,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-15 22:26:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17383 states. [2019-11-15 22:26:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17383 to 14860. [2019-11-15 22:26:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14860 states. [2019-11-15 22:26:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14860 states to 14860 states and 42561 transitions. [2019-11-15 22:26:41,858 INFO L78 Accepts]: Start accepts. Automaton has 14860 states and 42561 transitions. Word has length 68 [2019-11-15 22:26:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:41,858 INFO L462 AbstractCegarLoop]: Abstraction has 14860 states and 42561 transitions. [2019-11-15 22:26:41,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14860 states and 42561 transitions. [2019-11-15 22:26:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:41,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:41,868 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:41,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:41,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1169136517, now seen corresponding path program 1 times [2019-11-15 22:26:41,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:41,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494197562] [2019-11-15 22:26:41,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:41,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:41,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494197562] [2019-11-15 22:26:41,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:41,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:41,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455450301] [2019-11-15 22:26:41,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:41,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:41,933 INFO L87 Difference]: Start difference. First operand 14860 states and 42561 transitions. Second operand 5 states. [2019-11-15 22:26:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:42,338 INFO L93 Difference]: Finished difference Result 19765 states and 56508 transitions. [2019-11-15 22:26:42,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:42,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:26:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:42,365 INFO L225 Difference]: With dead ends: 19765 [2019-11-15 22:26:42,365 INFO L226 Difference]: Without dead ends: 19765 [2019-11-15 22:26:42,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19765 states. [2019-11-15 22:26:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19765 to 15765. [2019-11-15 22:26:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15765 states. [2019-11-15 22:26:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15765 states to 15765 states and 45147 transitions. [2019-11-15 22:26:42,597 INFO L78 Accepts]: Start accepts. Automaton has 15765 states and 45147 transitions. Word has length 68 [2019-11-15 22:26:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:42,597 INFO L462 AbstractCegarLoop]: Abstraction has 15765 states and 45147 transitions. [2019-11-15 22:26:42,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15765 states and 45147 transitions. [2019-11-15 22:26:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:42,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:42,607 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:42,607 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash -638317946, now seen corresponding path program 1 times [2019-11-15 22:26:42,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:42,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084926385] [2019-11-15 22:26:42,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:42,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:42,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084926385] [2019-11-15 22:26:42,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:42,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:42,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552020851] [2019-11-15 22:26:42,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:42,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:42,682 INFO L87 Difference]: Start difference. First operand 15765 states and 45147 transitions. Second operand 6 states. [2019-11-15 22:26:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:43,531 INFO L93 Difference]: Finished difference Result 24912 states and 71471 transitions. [2019-11-15 22:26:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:43,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 22:26:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:43,569 INFO L225 Difference]: With dead ends: 24912 [2019-11-15 22:26:43,569 INFO L226 Difference]: Without dead ends: 24912 [2019-11-15 22:26:43,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24912 states. [2019-11-15 22:26:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24912 to 19875. [2019-11-15 22:26:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19875 states. [2019-11-15 22:26:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19875 states to 19875 states and 57550 transitions. [2019-11-15 22:26:43,855 INFO L78 Accepts]: Start accepts. Automaton has 19875 states and 57550 transitions. Word has length 68 [2019-11-15 22:26:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:43,855 INFO L462 AbstractCegarLoop]: Abstraction has 19875 states and 57550 transitions. [2019-11-15 22:26:43,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 19875 states and 57550 transitions. [2019-11-15 22:26:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:43,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:43,867 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:43,867 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:43,868 INFO L82 PathProgramCache]: Analyzing trace with hash 249185735, now seen corresponding path program 1 times [2019-11-15 22:26:43,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:43,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328274253] [2019-11-15 22:26:43,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:43,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:43,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328274253] [2019-11-15 22:26:43,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:43,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:26:43,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382514689] [2019-11-15 22:26:43,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:26:43,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:26:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:26:43,925 INFO L87 Difference]: Start difference. First operand 19875 states and 57550 transitions. Second operand 4 states. [2019-11-15 22:26:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:44,486 INFO L93 Difference]: Finished difference Result 21582 states and 61994 transitions. [2019-11-15 22:26:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:26:44,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:26:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:44,517 INFO L225 Difference]: With dead ends: 21582 [2019-11-15 22:26:44,517 INFO L226 Difference]: Without dead ends: 21246 [2019-11-15 22:26:44,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-15 22:26:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21246 states. [2019-11-15 22:26:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21246 to 19704. [2019-11-15 22:26:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19704 states. [2019-11-15 22:26:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19704 states to 19704 states and 56674 transitions. [2019-11-15 22:26:44,784 INFO L78 Accepts]: Start accepts. Automaton has 19704 states and 56674 transitions. Word has length 68 [2019-11-15 22:26:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:44,784 INFO L462 AbstractCegarLoop]: Abstraction has 19704 states and 56674 transitions. [2019-11-15 22:26:44,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:26:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19704 states and 56674 transitions. [2019-11-15 22:26:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:44,797 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:44,797 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:44,797 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1859697991, now seen corresponding path program 1 times [2019-11-15 22:26:44,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:44,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030653403] [2019-11-15 22:26:44,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:44,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:44,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030653403] [2019-11-15 22:26:44,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:44,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:26:44,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934125539] [2019-11-15 22:26:44,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:26:44,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:26:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:26:44,953 INFO L87 Difference]: Start difference. First operand 19704 states and 56674 transitions. Second operand 9 states. [2019-11-15 22:26:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:45,681 INFO L93 Difference]: Finished difference Result 25031 states and 71607 transitions. [2019-11-15 22:26:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:26:45,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-15 22:26:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:45,725 INFO L225 Difference]: With dead ends: 25031 [2019-11-15 22:26:45,725 INFO L226 Difference]: Without dead ends: 25031 [2019-11-15 22:26:45,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:26:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25031 states. [2019-11-15 22:26:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25031 to 21057. [2019-11-15 22:26:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21057 states. [2019-11-15 22:26:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21057 states to 21057 states and 60604 transitions. [2019-11-15 22:26:46,036 INFO L78 Accepts]: Start accepts. Automaton has 21057 states and 60604 transitions. Word has length 68 [2019-11-15 22:26:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:46,036 INFO L462 AbstractCegarLoop]: Abstraction has 21057 states and 60604 transitions. [2019-11-15 22:26:46,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:26:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21057 states and 60604 transitions. [2019-11-15 22:26:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:26:46,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:46,052 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:26:46,052 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1547765624, now seen corresponding path program 1 times [2019-11-15 22:26:46,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:46,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514854582] [2019-11-15 22:26:46,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:46,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514854582] [2019-11-15 22:26:46,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:46,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:46,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680841585] [2019-11-15 22:26:46,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:46,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:46,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:46,119 INFO L87 Difference]: Start difference. First operand 21057 states and 60604 transitions. Second operand 5 states. [2019-11-15 22:26:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:46,175 INFO L93 Difference]: Finished difference Result 6189 states and 14491 transitions. [2019-11-15 22:26:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:26:46,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 22:26:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:46,182 INFO L225 Difference]: With dead ends: 6189 [2019-11-15 22:26:46,182 INFO L226 Difference]: Without dead ends: 5017 [2019-11-15 22:26:46,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-15 22:26:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5017 states. [2019-11-15 22:26:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5017 to 4280. [2019-11-15 22:26:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4280 states. [2019-11-15 22:26:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 9827 transitions. [2019-11-15 22:26:46,229 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 9827 transitions. Word has length 68 [2019-11-15 22:26:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:46,229 INFO L462 AbstractCegarLoop]: Abstraction has 4280 states and 9827 transitions. [2019-11-15 22:26:46,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 9827 transitions. [2019-11-15 22:26:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:46,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:46,233 INFO L380 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, 1, 1, 1, 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-11-15 22:26:46,233 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -191495264, now seen corresponding path program 1 times [2019-11-15 22:26:46,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:46,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472942031] [2019-11-15 22:26:46,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:46,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472942031] [2019-11-15 22:26:46,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:46,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:46,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722792805] [2019-11-15 22:26:46,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:46,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:46,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:46,296 INFO L87 Difference]: Start difference. First operand 4280 states and 9827 transitions. Second operand 5 states. [2019-11-15 22:26:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:46,582 INFO L93 Difference]: Finished difference Result 4933 states and 11178 transitions. [2019-11-15 22:26:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:46,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-15 22:26:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:46,587 INFO L225 Difference]: With dead ends: 4933 [2019-11-15 22:26:46,587 INFO L226 Difference]: Without dead ends: 4902 [2019-11-15 22:26:46,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-15 22:26:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4417. [2019-11-15 22:26:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4417 states. [2019-11-15 22:26:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 10096 transitions. [2019-11-15 22:26:46,642 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 10096 transitions. Word has length 83 [2019-11-15 22:26:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:46,643 INFO L462 AbstractCegarLoop]: Abstraction has 4417 states and 10096 transitions. [2019-11-15 22:26:46,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 10096 transitions. [2019-11-15 22:26:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:46,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:46,649 INFO L380 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, 1, 1, 1, 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-11-15 22:26:46,649 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:46,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 978114163, now seen corresponding path program 1 times [2019-11-15 22:26:46,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:46,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454809085] [2019-11-15 22:26:46,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:46,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:46,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454809085] [2019-11-15 22:26:46,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:46,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:46,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680206529] [2019-11-15 22:26:46,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:46,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:46,755 INFO L87 Difference]: Start difference. First operand 4417 states and 10096 transitions. Second operand 6 states. [2019-11-15 22:26:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:47,044 INFO L93 Difference]: Finished difference Result 5736 states and 13062 transitions. [2019-11-15 22:26:47,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:26:47,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 22:26:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:47,051 INFO L225 Difference]: With dead ends: 5736 [2019-11-15 22:26:47,051 INFO L226 Difference]: Without dead ends: 5718 [2019-11-15 22:26:47,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:26:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2019-11-15 22:26:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 4710. [2019-11-15 22:26:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2019-11-15 22:26:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 10801 transitions. [2019-11-15 22:26:47,102 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 10801 transitions. Word has length 83 [2019-11-15 22:26:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:47,103 INFO L462 AbstractCegarLoop]: Abstraction has 4710 states and 10801 transitions. [2019-11-15 22:26:47,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 10801 transitions. [2019-11-15 22:26:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:47,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:47,108 INFO L380 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, 1, 1, 1, 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-11-15 22:26:47,108 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -818837196, now seen corresponding path program 1 times [2019-11-15 22:26:47,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:47,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060378486] [2019-11-15 22:26:47,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:47,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060378486] [2019-11-15 22:26:47,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:47,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:26:47,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70594486] [2019-11-15 22:26:47,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:26:47,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:47,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:26:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:26:47,191 INFO L87 Difference]: Start difference. First operand 4710 states and 10801 transitions. Second operand 7 states. [2019-11-15 22:26:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:47,665 INFO L93 Difference]: Finished difference Result 6901 states and 15917 transitions. [2019-11-15 22:26:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:26:47,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-15 22:26:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:47,671 INFO L225 Difference]: With dead ends: 6901 [2019-11-15 22:26:47,671 INFO L226 Difference]: Without dead ends: 6901 [2019-11-15 22:26:47,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:26:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2019-11-15 22:26:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 5159. [2019-11-15 22:26:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-11-15 22:26:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11889 transitions. [2019-11-15 22:26:47,733 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11889 transitions. Word has length 83 [2019-11-15 22:26:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:47,734 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11889 transitions. [2019-11-15 22:26:47,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:26:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11889 transitions. [2019-11-15 22:26:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:47,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:47,738 INFO L380 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, 1, 1, 1, 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-11-15 22:26:47,738 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 68666485, now seen corresponding path program 1 times [2019-11-15 22:26:47,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:47,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267038162] [2019-11-15 22:26:47,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:47,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267038162] [2019-11-15 22:26:47,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:47,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:47,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030545694] [2019-11-15 22:26:47,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:47,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:47,838 INFO L87 Difference]: Start difference. First operand 5159 states and 11889 transitions. Second operand 6 states. [2019-11-15 22:26:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:47,920 INFO L93 Difference]: Finished difference Result 5923 states and 13536 transitions. [2019-11-15 22:26:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:26:47,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 22:26:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:47,927 INFO L225 Difference]: With dead ends: 5923 [2019-11-15 22:26:47,927 INFO L226 Difference]: Without dead ends: 5923 [2019-11-15 22:26:47,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5923 states. [2019-11-15 22:26:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5923 to 4712. [2019-11-15 22:26:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2019-11-15 22:26:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 10766 transitions. [2019-11-15 22:26:47,989 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 10766 transitions. Word has length 83 [2019-11-15 22:26:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:47,989 INFO L462 AbstractCegarLoop]: Abstraction has 4712 states and 10766 transitions. [2019-11-15 22:26:47,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 10766 transitions. [2019-11-15 22:26:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:26:47,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:47,993 INFO L380 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, 1, 1, 1, 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-11-15 22:26:47,993 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:47,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1663309067, now seen corresponding path program 1 times [2019-11-15 22:26:47,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:47,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582026846] [2019-11-15 22:26:47,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:47,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:48,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582026846] [2019-11-15 22:26:48,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:48,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:48,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454727947] [2019-11-15 22:26:48,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:48,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:48,109 INFO L87 Difference]: Start difference. First operand 4712 states and 10766 transitions. Second operand 6 states. [2019-11-15 22:26:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:48,253 INFO L93 Difference]: Finished difference Result 4532 states and 10229 transitions. [2019-11-15 22:26:48,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:26:48,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-15 22:26:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:48,258 INFO L225 Difference]: With dead ends: 4532 [2019-11-15 22:26:48,258 INFO L226 Difference]: Without dead ends: 4532 [2019-11-15 22:26:48,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-11-15 22:26:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 3096. [2019-11-15 22:26:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-11-15 22:26:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 7068 transitions. [2019-11-15 22:26:48,295 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 7068 transitions. Word has length 83 [2019-11-15 22:26:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 7068 transitions. [2019-11-15 22:26:48,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 7068 transitions. [2019-11-15 22:26:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:48,299 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:48,300 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:48,300 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1812350299, now seen corresponding path program 1 times [2019-11-15 22:26:48,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:48,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454575104] [2019-11-15 22:26:48,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:48,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454575104] [2019-11-15 22:26:48,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:48,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:26:48,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206743925] [2019-11-15 22:26:48,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:26:48,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:26:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:48,461 INFO L87 Difference]: Start difference. First operand 3096 states and 7068 transitions. Second operand 8 states. [2019-11-15 22:26:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:48,865 INFO L93 Difference]: Finished difference Result 3596 states and 8134 transitions. [2019-11-15 22:26:48,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:26:48,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 22:26:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:48,869 INFO L225 Difference]: With dead ends: 3596 [2019-11-15 22:26:48,869 INFO L226 Difference]: Without dead ends: 3596 [2019-11-15 22:26:48,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:26:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2019-11-15 22:26:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3195. [2019-11-15 22:26:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-15 22:26:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 7272 transitions. [2019-11-15 22:26:48,915 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 7272 transitions. Word has length 85 [2019-11-15 22:26:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:48,915 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 7272 transitions. [2019-11-15 22:26:48,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:26:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 7272 transitions. [2019-11-15 22:26:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:48,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:48,919 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:48,919 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash -924846618, now seen corresponding path program 1 times [2019-11-15 22:26:48,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:48,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015128090] [2019-11-15 22:26:48,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:48,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:49,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015128090] [2019-11-15 22:26:49,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:49,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:26:49,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713607669] [2019-11-15 22:26:49,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:26:49,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:26:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:26:49,106 INFO L87 Difference]: Start difference. First operand 3195 states and 7272 transitions. Second operand 9 states. [2019-11-15 22:26:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:49,589 INFO L93 Difference]: Finished difference Result 8549 states and 19618 transitions. [2019-11-15 22:26:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:26:49,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-15 22:26:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:49,596 INFO L225 Difference]: With dead ends: 8549 [2019-11-15 22:26:49,597 INFO L226 Difference]: Without dead ends: 5650 [2019-11-15 22:26:49,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:26:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2019-11-15 22:26:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 3373. [2019-11-15 22:26:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3373 states. [2019-11-15 22:26:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 7636 transitions. [2019-11-15 22:26:49,654 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 7636 transitions. Word has length 85 [2019-11-15 22:26:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:49,655 INFO L462 AbstractCegarLoop]: Abstraction has 3373 states and 7636 transitions. [2019-11-15 22:26:49,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:26:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 7636 transitions. [2019-11-15 22:26:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:49,659 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:49,659 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:49,659 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:49,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1219878257, now seen corresponding path program 1 times [2019-11-15 22:26:49,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:49,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634653936] [2019-11-15 22:26:49,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:49,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:49,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634653936] [2019-11-15 22:26:49,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:49,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:26:49,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535307900] [2019-11-15 22:26:49,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:26:49,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:49,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:26:49,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:26:49,764 INFO L87 Difference]: Start difference. First operand 3373 states and 7636 transitions. Second operand 6 states. [2019-11-15 22:26:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:50,038 INFO L93 Difference]: Finished difference Result 3722 states and 8360 transitions. [2019-11-15 22:26:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:26:50,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-15 22:26:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:50,043 INFO L225 Difference]: With dead ends: 3722 [2019-11-15 22:26:50,043 INFO L226 Difference]: Without dead ends: 3650 [2019-11-15 22:26:50,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:26:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2019-11-15 22:26:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3267. [2019-11-15 22:26:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2019-11-15 22:26:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 7331 transitions. [2019-11-15 22:26:50,090 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 7331 transitions. Word has length 85 [2019-11-15 22:26:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:50,090 INFO L462 AbstractCegarLoop]: Abstraction has 3267 states and 7331 transitions. [2019-11-15 22:26:50,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:26:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 7331 transitions. [2019-11-15 22:26:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:50,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:50,094 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:50,094 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash -857331086, now seen corresponding path program 2 times [2019-11-15 22:26:50,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:50,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67918862] [2019-11-15 22:26:50,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:50,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-11-15 22:26:50,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67918862] [2019-11-15 22:26:50,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:50,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:26:50,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200516326] [2019-11-15 22:26:50,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:26:50,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:26:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:26:50,244 INFO L87 Difference]: Start difference. First operand 3267 states and 7331 transitions. Second operand 8 states. [2019-11-15 22:26:50,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:50,328 INFO L93 Difference]: Finished difference Result 5512 states and 12425 transitions. [2019-11-15 22:26:50,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:26:50,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 22:26:50,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:50,330 INFO L225 Difference]: With dead ends: 5512 [2019-11-15 22:26:50,331 INFO L226 Difference]: Without dead ends: 2334 [2019-11-15 22:26:50,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:26:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2019-11-15 22:26:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2334. [2019-11-15 22:26:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2019-11-15 22:26:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 5239 transitions. [2019-11-15 22:26:50,353 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 5239 transitions. Word has length 85 [2019-11-15 22:26:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:50,353 INFO L462 AbstractCegarLoop]: Abstraction has 2334 states and 5239 transitions. [2019-11-15 22:26:50,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:26:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 5239 transitions. [2019-11-15 22:26:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:50,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:50,356 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:50,356 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1526104122, now seen corresponding path program 3 times [2019-11-15 22:26:50,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:50,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681544472] [2019-11-15 22:26:50,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:26:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:26:50,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681544472] [2019-11-15 22:26:50,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:26:50,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:26:50,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231954915] [2019-11-15 22:26:50,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:26:50,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:26:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:26:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:50,429 INFO L87 Difference]: Start difference. First operand 2334 states and 5239 transitions. Second operand 5 states. [2019-11-15 22:26:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:26:50,473 INFO L93 Difference]: Finished difference Result 2459 states and 5494 transitions. [2019-11-15 22:26:50,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:26:50,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 22:26:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:26:50,477 INFO L225 Difference]: With dead ends: 2459 [2019-11-15 22:26:50,477 INFO L226 Difference]: Without dead ends: 2459 [2019-11-15 22:26:50,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:26:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-11-15 22:26:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2418. [2019-11-15 22:26:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-11-15 22:26:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 5409 transitions. [2019-11-15 22:26:50,510 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 5409 transitions. Word has length 85 [2019-11-15 22:26:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:26:50,511 INFO L462 AbstractCegarLoop]: Abstraction has 2418 states and 5409 transitions. [2019-11-15 22:26:50,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:26:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 5409 transitions. [2019-11-15 22:26:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 22:26:50,514 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:26:50,514 INFO L380 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, 1, 1, 1, 1, 1, 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-11-15 22:26:50,514 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:26:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:26:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 243307137, now seen corresponding path program 1 times [2019-11-15 22:26:50,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:26:50,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361293557] [2019-11-15 22:26:50,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:26:50,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:26:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:26:50,599 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:26:50,600 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:26:50,717 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:26:50,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:26:50 BasicIcfg [2019-11-15 22:26:50,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:26:50,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:26:50,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:26:50,725 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:26:50,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:26:16" (3/4) ... [2019-11-15 22:26:50,728 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:26:50,898 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b0054641-1f1c-41ba-bf23-66ddf5aa1f15/bin/uautomizer/witness.graphml [2019-11-15 22:26:50,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:26:50,901 INFO L168 Benchmark]: Toolchain (without parser) took 36191.67 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -210.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 22:26:50,901 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:50,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:50,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.14 ms. Allocated memory is still 1.2 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-11-15 22:26:50,903 INFO L168 Benchmark]: Boogie Preprocessor took 40.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:26:50,903 INFO L168 Benchmark]: RCFGBuilder took 736.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:50,903 INFO L168 Benchmark]: TraceAbstraction took 34484.99 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -153.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:26:50,905 INFO L168 Benchmark]: Witness Printer took 174.84 ms. Allocated memory is still 3.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:26:50,908 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 686.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.14 ms. Allocated memory is still 1.2 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 40.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 736.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34484.99 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -153.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 174.84 ms. Allocated memory is still 3.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1661; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1661, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1662; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1662, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 196 locations, 3 error locations. Result: UNSAFE, OverallTime: 34.3s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8204 SDtfs, 9296 SDslu, 19010 SDs, 0 SdLazy, 6629 SolverSat, 467 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 71477 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2129 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2014 ConstructedInterpolants, 0 QuantifiedInterpolants, 399452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...