./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.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_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/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 1dbde380403f7bd83bc1a9b7ee17b5975367fb64 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:20:25,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:20:25,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:20:26,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:20:26,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:20:26,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:20:26,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:20:26,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:20:26,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:20:26,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:20:26,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:20:26,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:20:26,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:20:26,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:20:26,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:20:26,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:20:26,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:20:26,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:20:26,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:20:26,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:20:26,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:20:26,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:20:26,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:20:26,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:20:26,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:20:26,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:20:26,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:20:26,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:20:26,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:20:26,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:20:26,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:20:26,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:20:26,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:20:26,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:20:26,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:20:26,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:20:26,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:20:26,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:20:26,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:20:26,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:20:26,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:20:26,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:20:26,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:20:26,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:20:26,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:20:26,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:20:26,093 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:20:26,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:20:26,094 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:20:26,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:20:26,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:20:26,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:20:26,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:20:26,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:20:26,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:20:26,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:20:26,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:20:26,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:20:26,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:20:26,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:20:26,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:20:26,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:20:26,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:20:26,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:20:26,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:20:26,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:20:26,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:20:26,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:20:26,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:20:26,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:20:26,098 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_466a71d8-fa30-4c8a-b672-22f3c091ad98/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 -> 1dbde380403f7bd83bc1a9b7ee17b5975367fb64 [2019-11-16 00:20:26,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:20:26,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:20:26,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:20:26,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:20:26,166 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:20:26,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc.i [2019-11-16 00:20:26,225 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/data/c3f137397/fc90f06bf66f4e1c9485476cae182cb6/FLAG6c5214eb9 [2019-11-16 00:20:26,754 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:20:26,755 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc.i [2019-11-16 00:20:26,774 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/data/c3f137397/fc90f06bf66f4e1c9485476cae182cb6/FLAG6c5214eb9 [2019-11-16 00:20:27,063 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/data/c3f137397/fc90f06bf66f4e1c9485476cae182cb6 [2019-11-16 00:20:27,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:20:27,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:20:27,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:27,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:20:27,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:20:27,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6a5daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27, skipping insertion in model container [2019-11-16 00:20:27,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,082 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:20:27,129 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:20:27,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:27,649 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:20:27,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:20:27,778 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:20:27,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27 WrapperNode [2019-11-16 00:20:27,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:20:27,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:27,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:20:27,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:20:27,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:20:27,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:20:27,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:20:27,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:20:27,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... [2019-11-16 00:20:27,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:20:27,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:20:27,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:20:27,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:20:27,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/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-16 00:20:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:20:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:20:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:20:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:20:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:20:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:20:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:20:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:20:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:20:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:20:27,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:20:27,998 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:20:28,889 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:20:28,889 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:20:28,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:28 BoogieIcfgContainer [2019-11-16 00:20:28,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:20:28,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:20:28,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:20:28,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:20:28,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:27" (1/3) ... [2019-11-16 00:20:28,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564895df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:28, skipping insertion in model container [2019-11-16 00:20:28,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:27" (2/3) ... [2019-11-16 00:20:28,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564895df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:28, skipping insertion in model container [2019-11-16 00:20:28,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:28" (3/3) ... [2019-11-16 00:20:28,900 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc.i [2019-11-16 00:20:28,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,948 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,949 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,949 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,949 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,949 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,950 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,950 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,950 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,951 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,952 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,953 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,954 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,954 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,954 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,954 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,955 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,956 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,957 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,959 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,959 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,970 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,971 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,971 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,971 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,971 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,972 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,976 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,986 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,987 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,987 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,987 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,989 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,990 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,990 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,990 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,990 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,991 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,991 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,992 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,992 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,994 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,994 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,995 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,996 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,996 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,996 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,996 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,997 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,997 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,997 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,998 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,999 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,999 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,999 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:28,999 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,000 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,001 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,002 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,003 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,004 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:20:29,012 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:20:29,012 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:20:29,019 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:20:29,029 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:20:29,047 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:20:29,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:20:29,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:20:29,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:20:29,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:20:29,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:20:29,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:20:29,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:20:29,060 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-16 00:20:31,844 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-16 00:20:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-16 00:20:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:20:31,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:31,853 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] [2019-11-16 00:20:31,855 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:31,861 INFO L82 PathProgramCache]: Analyzing trace with hash -120544767, now seen corresponding path program 1 times [2019-11-16 00:20:31,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:31,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735924203] [2019-11-16 00:20:31,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:31,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:31,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:32,135 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-16 00:20:32,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735924203] [2019-11-16 00:20:32,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:32,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:20:32,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919888450] [2019-11-16 00:20:32,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:32,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:32,161 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-16 00:20:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:33,155 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-16 00:20:33,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:33,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-16 00:20:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:33,440 INFO L225 Difference]: With dead ends: 33591 [2019-11-16 00:20:33,440 INFO L226 Difference]: Without dead ends: 25703 [2019-11-16 00:20:33,442 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-16 00:20:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-16 00:20:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-16 00:20:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-16 00:20:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-16 00:20:34,938 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-16 00:20:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:34,938 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-16 00:20:34,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-16 00:20:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:20:34,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:34,952 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] [2019-11-16 00:20:34,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1401012243, now seen corresponding path program 1 times [2019-11-16 00:20:34,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:34,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114503715] [2019-11-16 00:20:34,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:34,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:34,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:35,120 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-16 00:20:35,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114503715] [2019-11-16 00:20:35,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:35,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:35,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972016498] [2019-11-16 00:20:35,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:35,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:35,124 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-16 00:20:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:36,327 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-16 00:20:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:20:36,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:20:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:36,519 INFO L225 Difference]: With dead ends: 41081 [2019-11-16 00:20:36,519 INFO L226 Difference]: Without dead ends: 40545 [2019-11-16 00:20:36,524 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-16 00:20:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-16 00:20:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-16 00:20:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-16 00:20:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-16 00:20:38,201 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-16 00:20:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:38,202 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-16 00:20:38,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-16 00:20:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:20:38,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:38,209 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-16 00:20:38,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:38,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:38,210 INFO L82 PathProgramCache]: Analyzing trace with hash -168847436, now seen corresponding path program 1 times [2019-11-16 00:20:38,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:38,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108904354] [2019-11-16 00:20:38,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:38,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:38,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:38,301 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-16 00:20:38,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108904354] [2019-11-16 00:20:38,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:38,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:38,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696912706] [2019-11-16 00:20:38,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:38,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:38,303 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-16 00:20:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:39,396 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-16 00:20:39,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:20:39,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-16 00:20:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:39,746 INFO L225 Difference]: With dead ends: 49778 [2019-11-16 00:20:39,746 INFO L226 Difference]: Without dead ends: 49274 [2019-11-16 00:20:39,747 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-16 00:20:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-16 00:20:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-16 00:20:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-16 00:20:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-16 00:20:40,945 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-16 00:20:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:40,945 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-16 00:20:40,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-16 00:20:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-16 00:20:40,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:40,957 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] [2019-11-16 00:20:40,957 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1917601690, now seen corresponding path program 1 times [2019-11-16 00:20:40,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:40,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609810293] [2019-11-16 00:20:40,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:40,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:40,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:41,010 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-16 00:20:41,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609810293] [2019-11-16 00:20:41,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:41,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:41,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879380323] [2019-11-16 00:20:41,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:41,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:41,013 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-16 00:20:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:41,830 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-16 00:20:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:41,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-16 00:20:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:42,019 INFO L225 Difference]: With dead ends: 61087 [2019-11-16 00:20:42,020 INFO L226 Difference]: Without dead ends: 61087 [2019-11-16 00:20:42,020 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-16 00:20:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-16 00:20:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-16 00:20:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-16 00:20:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-16 00:20:43,221 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-16 00:20:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:43,221 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-16 00:20:43,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-16 00:20:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:20:43,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:43,242 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] [2019-11-16 00:20:43,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash -740471995, now seen corresponding path program 1 times [2019-11-16 00:20:43,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:43,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725819755] [2019-11-16 00:20:43,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:43,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:43,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:43,437 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-16 00:20:43,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725819755] [2019-11-16 00:20:43,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:43,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:20:43,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103006559] [2019-11-16 00:20:43,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:20:43,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:20:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:43,441 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-16 00:20:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:44,903 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-16 00:20:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:20:44,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:20:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:45,061 INFO L225 Difference]: With dead ends: 63756 [2019-11-16 00:20:45,061 INFO L226 Difference]: Without dead ends: 63756 [2019-11-16 00:20:45,062 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-16 00:20:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-16 00:20:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-16 00:20:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-16 00:20:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-16 00:20:46,200 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-16 00:20:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:46,200 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-16 00:20:46,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:20:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-16 00:20:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:20:46,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:46,218 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] [2019-11-16 00:20:46,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1757543942, now seen corresponding path program 1 times [2019-11-16 00:20:46,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:46,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576762897] [2019-11-16 00:20:46,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:46,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:46,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:46,335 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-16 00:20:46,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576762897] [2019-11-16 00:20:46,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:46,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:20:46,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586124360] [2019-11-16 00:20:46,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:20:46,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:46,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:20:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:46,339 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-16 00:20:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:47,893 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-16 00:20:47,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:20:47,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-16 00:20:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:48,057 INFO L225 Difference]: With dead ends: 83685 [2019-11-16 00:20:48,057 INFO L226 Difference]: Without dead ends: 83685 [2019-11-16 00:20:48,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:20:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-16 00:20:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-16 00:20:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-16 00:20:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-16 00:20:49,458 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-16 00:20:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:49,458 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-16 00:20:49,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:20:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-16 00:20:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:20:49,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:49,475 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] [2019-11-16 00:20:49,475 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1649919673, now seen corresponding path program 1 times [2019-11-16 00:20:49,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:49,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887768432] [2019-11-16 00:20:49,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:49,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:49,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:49,590 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-16 00:20:49,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887768432] [2019-11-16 00:20:49,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:49,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:49,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551149630] [2019-11-16 00:20:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:49,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:49,592 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 5 states. [2019-11-16 00:20:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:49,698 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-11-16 00:20:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:20:49,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-16 00:20:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:49,720 INFO L225 Difference]: With dead ends: 12159 [2019-11-16 00:20:49,720 INFO L226 Difference]: Without dead ends: 10674 [2019-11-16 00:20:49,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-11-16 00:20:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-11-16 00:20:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-11-16 00:20:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-11-16 00:20:50,367 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-11-16 00:20:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:50,367 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-11-16 00:20:50,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-11-16 00:20:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:20:50,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:50,370 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] [2019-11-16 00:20:50,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:50,371 INFO L82 PathProgramCache]: Analyzing trace with hash -796322971, now seen corresponding path program 1 times [2019-11-16 00:20:50,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:50,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126159099] [2019-11-16 00:20:50,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:50,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:50,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:50,453 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-16 00:20:50,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126159099] [2019-11-16 00:20:50,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:50,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:20:50,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336249727] [2019-11-16 00:20:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:20:50,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:20:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:50,455 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-11-16 00:20:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:51,071 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-11-16 00:20:51,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:20:51,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:20:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:51,098 INFO L225 Difference]: With dead ends: 13182 [2019-11-16 00:20:51,099 INFO L226 Difference]: Without dead ends: 13119 [2019-11-16 00:20:51,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:20:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-11-16 00:20:51,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-11-16 00:20:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-16 00:20:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-11-16 00:20:51,280 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-11-16 00:20:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:51,281 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-11-16 00:20:51,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:20:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-11-16 00:20:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:20:51,285 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:51,285 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] [2019-11-16 00:20:51,285 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash 458880321, now seen corresponding path program 1 times [2019-11-16 00:20:51,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:51,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098893486] [2019-11-16 00:20:51,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:51,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:51,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:51,370 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-16 00:20:51,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098893486] [2019-11-16 00:20:51,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:51,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:20:51,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760886601] [2019-11-16 00:20:51,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:51,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:51,377 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-11-16 00:20:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:51,528 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-11-16 00:20:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:20:51,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-16 00:20:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:51,555 INFO L225 Difference]: With dead ends: 12862 [2019-11-16 00:20:51,555 INFO L226 Difference]: Without dead ends: 12862 [2019-11-16 00:20:51,556 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-16 00:20:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-11-16 00:20:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-11-16 00:20:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-11-16 00:20:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-11-16 00:20:51,738 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-11-16 00:20:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:51,738 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-11-16 00:20:51,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-11-16 00:20:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:20:51,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:51,742 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] [2019-11-16 00:20:51,743 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:51,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2093276640, now seen corresponding path program 1 times [2019-11-16 00:20:51,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:51,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109944458] [2019-11-16 00:20:51,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:51,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:51,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:51,862 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-16 00:20:51,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109944458] [2019-11-16 00:20:51,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:51,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:20:51,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111181682] [2019-11-16 00:20:51,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:20:51,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:20:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:51,864 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-11-16 00:20:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:52,506 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-11-16 00:20:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:20:52,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-16 00:20:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:52,527 INFO L225 Difference]: With dead ends: 14219 [2019-11-16 00:20:52,528 INFO L226 Difference]: Without dead ends: 14158 [2019-11-16 00:20:52,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:20:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-11-16 00:20:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-11-16 00:20:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-11-16 00:20:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-11-16 00:20:52,728 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-11-16 00:20:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:52,728 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-11-16 00:20:52,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:20:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-11-16 00:20:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:20:52,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:52,735 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] [2019-11-16 00:20:52,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:52,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1966202348, now seen corresponding path program 1 times [2019-11-16 00:20:52,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:52,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004867034] [2019-11-16 00:20:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:52,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:52,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:52,785 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-16 00:20:52,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004867034] [2019-11-16 00:20:52,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:52,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:20:52,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304279571] [2019-11-16 00:20:52,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:52,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:52,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:52,787 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-11-16 00:20:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:53,264 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-11-16 00:20:53,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:20:53,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:20:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:53,300 INFO L225 Difference]: With dead ends: 18895 [2019-11-16 00:20:53,300 INFO L226 Difference]: Without dead ends: 18847 [2019-11-16 00:20:53,301 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-16 00:20:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-11-16 00:20:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-11-16 00:20:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-11-16 00:20:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-11-16 00:20:53,618 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-11-16 00:20:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:53,618 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-11-16 00:20:53,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-11-16 00:20:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:20:53,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:53,627 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] [2019-11-16 00:20:53,627 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2033209101, now seen corresponding path program 1 times [2019-11-16 00:20:53,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:53,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814124172] [2019-11-16 00:20:53,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:53,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:53,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:53,696 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-16 00:20:53,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814124172] [2019-11-16 00:20:53,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:53,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:20:53,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866862853] [2019-11-16 00:20:53,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:53,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:53,698 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-11-16 00:20:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:53,983 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-11-16 00:20:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:20:53,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:20:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:54,010 INFO L225 Difference]: With dead ends: 18169 [2019-11-16 00:20:54,010 INFO L226 Difference]: Without dead ends: 18169 [2019-11-16 00:20:54,010 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-16 00:20:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-11-16 00:20:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-11-16 00:20:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-11-16 00:20:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-11-16 00:20:54,242 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-11-16 00:20:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:54,242 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-11-16 00:20:54,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-11-16 00:20:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:20:54,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:54,251 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] [2019-11-16 00:20:54,251 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2064228908, now seen corresponding path program 1 times [2019-11-16 00:20:54,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:54,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3290413] [2019-11-16 00:20:54,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:54,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:54,304 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-16 00:20:54,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3290413] [2019-11-16 00:20:54,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:54,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:20:54,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607231771] [2019-11-16 00:20:54,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:20:54,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:54,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:20:54,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:20:54,307 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-11-16 00:20:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:54,551 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-11-16 00:20:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:20:54,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-16 00:20:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:54,574 INFO L225 Difference]: With dead ends: 15542 [2019-11-16 00:20:54,574 INFO L226 Difference]: Without dead ends: 15542 [2019-11-16 00:20:54,575 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-16 00:20:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-11-16 00:20:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-11-16 00:20:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-11-16 00:20:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-11-16 00:20:54,806 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-11-16 00:20:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:54,807 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-11-16 00:20:54,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:20:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-11-16 00:20:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:54,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:54,817 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] [2019-11-16 00:20:54,818 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1089808274, now seen corresponding path program 1 times [2019-11-16 00:20:54,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:54,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315751736] [2019-11-16 00:20:54,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:54,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:54,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-16 00:20:54,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315751736] [2019-11-16 00:20:54,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:54,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:20:54,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534086186] [2019-11-16 00:20:54,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:20:54,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:54,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:20:54,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:20:54,927 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-11-16 00:20:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:55,397 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-11-16 00:20:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:20:55,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-16 00:20:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:55,421 INFO L225 Difference]: With dead ends: 16701 [2019-11-16 00:20:55,421 INFO L226 Difference]: Without dead ends: 16701 [2019-11-16 00:20:55,422 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-16 00:20:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-11-16 00:20:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-11-16 00:20:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-11-16 00:20:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-11-16 00:20:55,682 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-11-16 00:20:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:55,682 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-11-16 00:20:55,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:20:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-11-16 00:20:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:55,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:55,694 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] [2019-11-16 00:20:55,694 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -948248015, now seen corresponding path program 1 times [2019-11-16 00:20:55,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:55,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143527457] [2019-11-16 00:20:55,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:55,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:55,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:55,926 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-16 00:20:55,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143527457] [2019-11-16 00:20:55,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:55,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:55,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612102636] [2019-11-16 00:20:55,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:55,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:55,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:55,928 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-11-16 00:20:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:56,322 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-11-16 00:20:56,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:20:56,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:20:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:56,352 INFO L225 Difference]: With dead ends: 19681 [2019-11-16 00:20:56,352 INFO L226 Difference]: Without dead ends: 19681 [2019-11-16 00:20:56,352 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-16 00:20:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-11-16 00:20:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-11-16 00:20:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-11-16 00:20:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-11-16 00:20:56,615 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-11-16 00:20:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:56,615 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-11-16 00:20:56,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-11-16 00:20:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:56,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:56,627 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] [2019-11-16 00:20:56,627 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:56,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1458782192, now seen corresponding path program 1 times [2019-11-16 00:20:56,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:56,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751401211] [2019-11-16 00:20:56,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:56,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:56,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:56,711 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-16 00:20:56,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751401211] [2019-11-16 00:20:56,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:56,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:56,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640569670] [2019-11-16 00:20:56,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:56,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:56,713 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-11-16 00:20:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:57,288 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-11-16 00:20:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:20:57,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:20:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:57,330 INFO L225 Difference]: With dead ends: 26550 [2019-11-16 00:20:57,330 INFO L226 Difference]: Without dead ends: 26550 [2019-11-16 00:20:57,331 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-16 00:20:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-11-16 00:20:57,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-11-16 00:20:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-11-16 00:20:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-11-16 00:20:57,652 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-11-16 00:20:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:57,652 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-11-16 00:20:57,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-11-16 00:20:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:57,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:57,664 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] [2019-11-16 00:20:57,664 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:57,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1028730641, now seen corresponding path program 1 times [2019-11-16 00:20:57,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:57,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687048968] [2019-11-16 00:20:57,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:57,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:57,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:57,719 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-16 00:20:57,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687048968] [2019-11-16 00:20:57,719 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:57,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:20:57,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042506204] [2019-11-16 00:20:57,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:20:57,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:57,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:20:57,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:20:57,720 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-11-16 00:20:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:58,233 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-11-16 00:20:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:20:58,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:20:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:58,279 INFO L225 Difference]: With dead ends: 28143 [2019-11-16 00:20:58,279 INFO L226 Difference]: Without dead ends: 28008 [2019-11-16 00:20:58,279 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-16 00:20:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-11-16 00:20:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-11-16 00:20:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-11-16 00:20:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-11-16 00:20:58,664 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-11-16 00:20:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:58,664 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-11-16 00:20:58,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:20:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-11-16 00:20:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:58,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:58,674 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] [2019-11-16 00:20:58,674 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -768220718, now seen corresponding path program 1 times [2019-11-16 00:20:58,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:58,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546128756] [2019-11-16 00:20:58,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:58,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:58,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:58,904 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-16 00:20:58,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546128756] [2019-11-16 00:20:58,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:58,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:20:58,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387983843] [2019-11-16 00:20:58,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:20:58,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:20:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:20:58,906 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 7 states. [2019-11-16 00:20:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:59,448 INFO L93 Difference]: Finished difference Result 23304 states and 65259 transitions. [2019-11-16 00:20:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:20:59,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-11-16 00:20:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:59,481 INFO L225 Difference]: With dead ends: 23304 [2019-11-16 00:20:59,481 INFO L226 Difference]: Without dead ends: 23304 [2019-11-16 00:20:59,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:20:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23304 states. [2019-11-16 00:20:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23304 to 19068. [2019-11-16 00:20:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19068 states. [2019-11-16 00:20:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19068 states to 19068 states and 53401 transitions. [2019-11-16 00:20:59,764 INFO L78 Accepts]: Start accepts. Automaton has 19068 states and 53401 transitions. Word has length 67 [2019-11-16 00:20:59,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:59,765 INFO L462 AbstractCegarLoop]: Abstraction has 19068 states and 53401 transitions. [2019-11-16 00:20:59,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:20:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19068 states and 53401 transitions. [2019-11-16 00:20:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:59,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:59,773 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] [2019-11-16 00:20:59,773 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:59,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:59,774 INFO L82 PathProgramCache]: Analyzing trace with hash 119282963, now seen corresponding path program 1 times [2019-11-16 00:20:59,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:59,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886771960] [2019-11-16 00:20:59,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:59,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:59,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:20:59,843 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-16 00:20:59,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886771960] [2019-11-16 00:20:59,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:20:59,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:20:59,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90701636] [2019-11-16 00:20:59,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:20:59,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:20:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:20:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:20:59,845 INFO L87 Difference]: Start difference. First operand 19068 states and 53401 transitions. Second operand 5 states. [2019-11-16 00:20:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:20:59,897 INFO L93 Difference]: Finished difference Result 5742 states and 13710 transitions. [2019-11-16 00:20:59,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:20:59,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-16 00:20:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:20:59,904 INFO L225 Difference]: With dead ends: 5742 [2019-11-16 00:20:59,904 INFO L226 Difference]: Without dead ends: 4764 [2019-11-16 00:20:59,904 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-16 00:20:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2019-11-16 00:20:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 3929. [2019-11-16 00:20:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-11-16 00:20:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 9180 transitions. [2019-11-16 00:20:59,966 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 9180 transitions. Word has length 67 [2019-11-16 00:20:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:20:59,966 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 9180 transitions. [2019-11-16 00:20:59,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:20:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 9180 transitions. [2019-11-16 00:20:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:20:59,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:20:59,971 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] [2019-11-16 00:20:59,971 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:20:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:20:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -355085295, now seen corresponding path program 1 times [2019-11-16 00:20:59,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:20:59,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525857342] [2019-11-16 00:20:59,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:59,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:20:59,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:20:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:00,013 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-16 00:21:00,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525857342] [2019-11-16 00:21:00,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:00,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:00,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341763394] [2019-11-16 00:21:00,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:21:00,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:00,016 INFO L87 Difference]: Start difference. First operand 3929 states and 9180 transitions. Second operand 3 states. [2019-11-16 00:21:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:00,053 INFO L93 Difference]: Finished difference Result 4939 states and 11353 transitions. [2019-11-16 00:21:00,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:00,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-16 00:21:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:00,059 INFO L225 Difference]: With dead ends: 4939 [2019-11-16 00:21:00,059 INFO L226 Difference]: Without dead ends: 4939 [2019-11-16 00:21:00,060 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-16 00:21:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2019-11-16 00:21:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 3872. [2019-11-16 00:21:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3872 states. [2019-11-16 00:21:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 8827 transitions. [2019-11-16 00:21:00,123 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 8827 transitions. Word has length 67 [2019-11-16 00:21:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:00,124 INFO L462 AbstractCegarLoop]: Abstraction has 3872 states and 8827 transitions. [2019-11-16 00:21:00,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:21:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 8827 transitions. [2019-11-16 00:21:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:21:00,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:00,129 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] [2019-11-16 00:21:00,130 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 480748516, now seen corresponding path program 1 times [2019-11-16 00:21:00,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:00,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907594462] [2019-11-16 00:21:00,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:00,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:00,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:00,231 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-16 00:21:00,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907594462] [2019-11-16 00:21:00,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:00,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:21:00,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328210937] [2019-11-16 00:21:00,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:21:00,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:00,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:21:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:21:00,236 INFO L87 Difference]: Start difference. First operand 3872 states and 8827 transitions. Second operand 5 states. [2019-11-16 00:21:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:00,450 INFO L93 Difference]: Finished difference Result 4823 states and 11022 transitions. [2019-11-16 00:21:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:21:00,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-16 00:21:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:00,455 INFO L225 Difference]: With dead ends: 4823 [2019-11-16 00:21:00,455 INFO L226 Difference]: Without dead ends: 4823 [2019-11-16 00:21:00,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:21:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2019-11-16 00:21:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4258. [2019-11-16 00:21:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2019-11-16 00:21:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 9716 transitions. [2019-11-16 00:21:00,501 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 9716 transitions. Word has length 73 [2019-11-16 00:21:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:00,502 INFO L462 AbstractCegarLoop]: Abstraction has 4258 states and 9716 transitions. [2019-11-16 00:21:00,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:21:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 9716 transitions. [2019-11-16 00:21:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:21:00,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:00,505 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] [2019-11-16 00:21:00,506 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:00,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:00,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2071408445, now seen corresponding path program 1 times [2019-11-16 00:21:00,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:00,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838152849] [2019-11-16 00:21:00,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:00,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:00,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:00,609 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-16 00:21:00,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838152849] [2019-11-16 00:21:00,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:00,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:21:00,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083501898] [2019-11-16 00:21:00,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:21:00,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:21:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:21:00,611 INFO L87 Difference]: Start difference. First operand 4258 states and 9716 transitions. Second operand 7 states. [2019-11-16 00:21:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:01,024 INFO L93 Difference]: Finished difference Result 4955 states and 11180 transitions. [2019-11-16 00:21:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:21:01,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-16 00:21:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:01,028 INFO L225 Difference]: With dead ends: 4955 [2019-11-16 00:21:01,028 INFO L226 Difference]: Without dead ends: 4902 [2019-11-16 00:21:01,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:21:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-11-16 00:21:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4316. [2019-11-16 00:21:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2019-11-16 00:21:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 9765 transitions. [2019-11-16 00:21:01,077 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 9765 transitions. Word has length 73 [2019-11-16 00:21:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:01,077 INFO L462 AbstractCegarLoop]: Abstraction has 4316 states and 9765 transitions. [2019-11-16 00:21:01,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:21:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 9765 transitions. [2019-11-16 00:21:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:21:01,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:01,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:01,082 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1201414691, now seen corresponding path program 1 times [2019-11-16 00:21:01,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:01,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487827865] [2019-11-16 00:21:01,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:01,169 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-16 00:21:01,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487827865] [2019-11-16 00:21:01,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:01,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:21:01,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776701433] [2019-11-16 00:21:01,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:21:01,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:01,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:21:01,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:21:01,171 INFO L87 Difference]: Start difference. First operand 4316 states and 9765 transitions. Second operand 3 states. [2019-11-16 00:21:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:01,402 INFO L93 Difference]: Finished difference Result 5922 states and 13049 transitions. [2019-11-16 00:21:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:21:01,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-16 00:21:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:01,409 INFO L225 Difference]: With dead ends: 5922 [2019-11-16 00:21:01,409 INFO L226 Difference]: Without dead ends: 5631 [2019-11-16 00:21:01,409 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-16 00:21:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-11-16 00:21:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5150. [2019-11-16 00:21:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2019-11-16 00:21:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 11491 transitions. [2019-11-16 00:21:01,487 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 11491 transitions. Word has length 94 [2019-11-16 00:21:01,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:01,487 INFO L462 AbstractCegarLoop]: Abstraction has 5150 states and 11491 transitions. [2019-11-16 00:21:01,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:21:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 11491 transitions. [2019-11-16 00:21:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:21:01,493 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:01,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:01,494 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1484565155, now seen corresponding path program 1 times [2019-11-16 00:21:01,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:01,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149587267] [2019-11-16 00:21:01,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:01,595 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-16 00:21:01,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149587267] [2019-11-16 00:21:01,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:01,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:21:01,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656520233] [2019-11-16 00:21:01,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:21:01,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:01,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:21:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:21:01,598 INFO L87 Difference]: Start difference. First operand 5150 states and 11491 transitions. Second operand 4 states. [2019-11-16 00:21:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:01,721 INFO L93 Difference]: Finished difference Result 5440 states and 12197 transitions. [2019-11-16 00:21:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:21:01,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:21:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:01,726 INFO L225 Difference]: With dead ends: 5440 [2019-11-16 00:21:01,726 INFO L226 Difference]: Without dead ends: 5440 [2019-11-16 00:21:01,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:21:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-11-16 00:21:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 4895. [2019-11-16 00:21:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2019-11-16 00:21:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 11028 transitions. [2019-11-16 00:21:01,779 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 11028 transitions. Word has length 94 [2019-11-16 00:21:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:01,780 INFO L462 AbstractCegarLoop]: Abstraction has 4895 states and 11028 transitions. [2019-11-16 00:21:01,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:21:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 11028 transitions. [2019-11-16 00:21:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:01,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:01,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:01,785 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2006724855, now seen corresponding path program 1 times [2019-11-16 00:21:01,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:01,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395383598] [2019-11-16 00:21:01,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:01,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:01,862 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-16 00:21:01,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395383598] [2019-11-16 00:21:01,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:01,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:21:01,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592829472] [2019-11-16 00:21:01,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:21:01,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:21:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:21:01,864 INFO L87 Difference]: Start difference. First operand 4895 states and 11028 transitions. Second operand 5 states. [2019-11-16 00:21:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:02,041 INFO L93 Difference]: Finished difference Result 5578 states and 12520 transitions. [2019-11-16 00:21:02,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:21:02,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-16 00:21:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:02,046 INFO L225 Difference]: With dead ends: 5578 [2019-11-16 00:21:02,047 INFO L226 Difference]: Without dead ends: 5578 [2019-11-16 00:21:02,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-16 00:21:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-11-16 00:21:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4288. [2019-11-16 00:21:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2019-11-16 00:21:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 9629 transitions. [2019-11-16 00:21:02,096 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 9629 transitions. Word has length 96 [2019-11-16 00:21:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:02,096 INFO L462 AbstractCegarLoop]: Abstraction has 4288 states and 9629 transitions. [2019-11-16 00:21:02,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:21:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 9629 transitions. [2019-11-16 00:21:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:02,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:02,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:02,101 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1995408728, now seen corresponding path program 1 times [2019-11-16 00:21:02,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:02,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032923363] [2019-11-16 00:21:02,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:02,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:02,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:02,183 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-16 00:21:02,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032923363] [2019-11-16 00:21:02,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:02,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:21:02,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245948483] [2019-11-16 00:21:02,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:21:02,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:21:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:21:02,186 INFO L87 Difference]: Start difference. First operand 4288 states and 9629 transitions. Second operand 4 states. [2019-11-16 00:21:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:02,391 INFO L93 Difference]: Finished difference Result 5028 states and 11235 transitions. [2019-11-16 00:21:02,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:21:02,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:21:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:02,397 INFO L225 Difference]: With dead ends: 5028 [2019-11-16 00:21:02,397 INFO L226 Difference]: Without dead ends: 4972 [2019-11-16 00:21:02,397 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-16 00:21:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-11-16 00:21:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4761. [2019-11-16 00:21:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2019-11-16 00:21:02,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 10672 transitions. [2019-11-16 00:21:02,449 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 10672 transitions. Word has length 96 [2019-11-16 00:21:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:02,450 INFO L462 AbstractCegarLoop]: Abstraction has 4761 states and 10672 transitions. [2019-11-16 00:21:02,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:21:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 10672 transitions. [2019-11-16 00:21:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:02,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:02,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:02,456 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 222349225, now seen corresponding path program 1 times [2019-11-16 00:21:02,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:02,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21667567] [2019-11-16 00:21:02,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:02,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:02,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:02,698 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-16 00:21:02,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21667567] [2019-11-16 00:21:02,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:02,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:21:02,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196323569] [2019-11-16 00:21:02,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:21:02,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:21:02,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:02,700 INFO L87 Difference]: Start difference. First operand 4761 states and 10672 transitions. Second operand 10 states. [2019-11-16 00:21:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:03,557 INFO L93 Difference]: Finished difference Result 6970 states and 15324 transitions. [2019-11-16 00:21:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:21:03,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-16 00:21:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:03,564 INFO L225 Difference]: With dead ends: 6970 [2019-11-16 00:21:03,564 INFO L226 Difference]: Without dead ends: 6946 [2019-11-16 00:21:03,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:21:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-16 00:21:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5449. [2019-11-16 00:21:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2019-11-16 00:21:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 12050 transitions. [2019-11-16 00:21:03,634 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 12050 transitions. Word has length 96 [2019-11-16 00:21:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:03,634 INFO L462 AbstractCegarLoop]: Abstraction has 5449 states and 12050 transitions. [2019-11-16 00:21:03,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:21:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 12050 transitions. [2019-11-16 00:21:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:03,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:03,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:03,640 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1109852906, now seen corresponding path program 1 times [2019-11-16 00:21:03,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:03,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191894709] [2019-11-16 00:21:03,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:03,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:03,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:03,857 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-16 00:21:03,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191894709] [2019-11-16 00:21:03,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:03,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:21:03,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929758876] [2019-11-16 00:21:03,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:21:03,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:21:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:21:03,859 INFO L87 Difference]: Start difference. First operand 5449 states and 12050 transitions. Second operand 9 states. [2019-11-16 00:21:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:04,771 INFO L93 Difference]: Finished difference Result 6918 states and 15160 transitions. [2019-11-16 00:21:04,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:21:04,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-16 00:21:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:04,778 INFO L225 Difference]: With dead ends: 6918 [2019-11-16 00:21:04,778 INFO L226 Difference]: Without dead ends: 6918 [2019-11-16 00:21:04,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:21:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2019-11-16 00:21:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 5737. [2019-11-16 00:21:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5737 states. [2019-11-16 00:21:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 12643 transitions. [2019-11-16 00:21:04,844 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 12643 transitions. Word has length 96 [2019-11-16 00:21:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:04,844 INFO L462 AbstractCegarLoop]: Abstraction has 5737 states and 12643 transitions. [2019-11-16 00:21:04,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:21:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 12643 transitions. [2019-11-16 00:21:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:04,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:04,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:04,850 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 433700138, now seen corresponding path program 1 times [2019-11-16 00:21:04,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:04,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355767074] [2019-11-16 00:21:04,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:04,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:04,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:05,078 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-16 00:21:05,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355767074] [2019-11-16 00:21:05,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:05,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:21:05,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018582803] [2019-11-16 00:21:05,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:21:05,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:21:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:21:05,080 INFO L87 Difference]: Start difference. First operand 5737 states and 12643 transitions. Second operand 9 states. [2019-11-16 00:21:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:05,803 INFO L93 Difference]: Finished difference Result 6089 states and 13371 transitions. [2019-11-16 00:21:05,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:21:05,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-16 00:21:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:05,810 INFO L225 Difference]: With dead ends: 6089 [2019-11-16 00:21:05,810 INFO L226 Difference]: Without dead ends: 6089 [2019-11-16 00:21:05,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:21:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2019-11-16 00:21:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 5604. [2019-11-16 00:21:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5604 states. [2019-11-16 00:21:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 12354 transitions. [2019-11-16 00:21:05,896 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 12354 transitions. Word has length 96 [2019-11-16 00:21:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:05,896 INFO L462 AbstractCegarLoop]: Abstraction has 5604 states and 12354 transitions. [2019-11-16 00:21:05,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:21:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 12354 transitions. [2019-11-16 00:21:05,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:05,904 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:05,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:05,904 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:05,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203819, now seen corresponding path program 1 times [2019-11-16 00:21:05,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:05,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48490475] [2019-11-16 00:21:05,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:05,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:06,146 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-16 00:21:06,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48490475] [2019-11-16 00:21:06,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:06,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:21:06,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79071597] [2019-11-16 00:21:06,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:21:06,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:21:06,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:21:06,148 INFO L87 Difference]: Start difference. First operand 5604 states and 12354 transitions. Second operand 10 states. [2019-11-16 00:21:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:06,848 INFO L93 Difference]: Finished difference Result 21862 states and 48629 transitions. [2019-11-16 00:21:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-16 00:21:06,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-16 00:21:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:06,865 INFO L225 Difference]: With dead ends: 21862 [2019-11-16 00:21:06,866 INFO L226 Difference]: Without dead ends: 12729 [2019-11-16 00:21:06,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:21:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2019-11-16 00:21:06,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 5320. [2019-11-16 00:21:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-11-16 00:21:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 11635 transitions. [2019-11-16 00:21:06,990 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 11635 transitions. Word has length 96 [2019-11-16 00:21:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:06,990 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 11635 transitions. [2019-11-16 00:21:06,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:21:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 11635 transitions. [2019-11-16 00:21:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:21:06,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:06,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:06,997 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash 500491279, now seen corresponding path program 2 times [2019-11-16 00:21:06,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:06,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892300880] [2019-11-16 00:21:06,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:06,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:06,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:07,143 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:07,143 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:21:07,330 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:21:07,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:21:07 BasicIcfg [2019-11-16 00:21:07,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:21:07,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:21:07,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:21:07,332 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:21:07,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:28" (3/4) ... [2019-11-16 00:21:07,335 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:21:07,491 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_466a71d8-fa30-4c8a-b672-22f3c091ad98/bin/uautomizer/witness.graphml [2019-11-16 00:21:07,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:21:07,494 INFO L168 Benchmark]: Toolchain (without parser) took 40426.58 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 940.8 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-16 00:21:07,494 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:07,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:07,495 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.11 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-16 00:21:07,496 INFO L168 Benchmark]: Boogie Preprocessor took 47.90 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-16 00:21:07,496 INFO L168 Benchmark]: RCFGBuilder took 1005.79 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:07,496 INFO L168 Benchmark]: TraceAbstraction took 38440.02 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:21:07,497 INFO L168 Benchmark]: Witness Printer took 160.15 ms. Allocated memory is still 3.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:07,500 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 711.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.11 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 47.90 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 1005.79 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: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38440.02 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 160.15 ms. Allocated memory is still 3.8 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t1605; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L803] 0 pthread_t t1606; VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L731] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L732] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L733] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L734] 1 x$r_buff0_thd1 = (_Bool)1 [L737] 1 y = 1 VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L804] FCALL, FORK 0 pthread_create(&t1606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __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 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L772] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L775] 2 x = x$flush_delayed ? x$mem_tmp : x [L776] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L814] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 38.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8819 SDtfs, 9222 SDslu, 20629 SDs, 0 SdLazy, 7782 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 86 SyntacticMatches, 21 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 78988 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2054 ConstructedInterpolants, 0 QuantifiedInterpolants, 411947 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...