./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.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_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/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 7f42d731525094a6cd35949032977f8d605fc795 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:44:10,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:44:10,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:44:10,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:44:10,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:44:10,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:44:10,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:44:10,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:44:10,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:44:10,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:44:10,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:44:10,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:44:10,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:44:10,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:44:10,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:44:10,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:44:10,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:44:10,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:44:10,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:44:10,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:44:10,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:44:10,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:44:10,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:44:10,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:44:10,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:44:10,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:44:10,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:44:10,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:44:10,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:44:10,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:44:10,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:44:10,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:44:10,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:44:10,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:44:10,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:44:10,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:44:10,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:44:10,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:44:10,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:44:10,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:44:10,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:44:10,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:44:10,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:44:10,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:44:10,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:44:10,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:44:10,837 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:44:10,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:44:10,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:44:10,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:44:10,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:44:10,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:44:10,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:44:10,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:44:10,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:44:10,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:44:10,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:44:10,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:44:10,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:44:10,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:44:10,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:44:10,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:44:10,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:44:10,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:10,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:44:10,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:44:10,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:44:10,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:44:10,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:44:10,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:44:10,843 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_8a517756-5c3f-4096-8859-c9421af8d6bc/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 -> 7f42d731525094a6cd35949032977f8d605fc795 [2019-11-15 23:44:10,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:44:10,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:44:10,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:44:10,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:44:10,889 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:44:10,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i [2019-11-15 23:44:10,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/data/97b26ecd6/dd01fca0ff244604bfe5be944eba7f5f/FLAG047733249 [2019-11-15 23:44:11,473 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:44:11,475 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/sv-benchmarks/c/pthread-wmm/mix041_power.oepc.i [2019-11-15 23:44:11,494 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/data/97b26ecd6/dd01fca0ff244604bfe5be944eba7f5f/FLAG047733249 [2019-11-15 23:44:11,731 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/data/97b26ecd6/dd01fca0ff244604bfe5be944eba7f5f [2019-11-15 23:44:11,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:44:11,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:44:11,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:11,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:44:11,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:44:11,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:11" (1/1) ... [2019-11-15 23:44:11,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed23c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:11, skipping insertion in model container [2019-11-15 23:44:11,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:11" (1/1) ... [2019-11-15 23:44:11,749 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:44:11,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:44:12,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:12,248 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:44:12,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:12,412 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:44:12,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12 WrapperNode [2019-11-15 23:44:12,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:12,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:12,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:44:12,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:44:12,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:44:12,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:44:12,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:44:12,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:44:12,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... [2019-11-15 23:44:12,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:44:12,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:44:12,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:44:12,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:44:12,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:44:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:44:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:44:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:44:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:44:12,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:44:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:44:12,581 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:44:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:44:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:44:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:44:12,583 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:44:13,193 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:44:13,194 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:44:13,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:13 BoogieIcfgContainer [2019-11-15 23:44:13,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:44:13,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:44:13,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:44:13,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:44:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:44:11" (1/3) ... [2019-11-15 23:44:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697ef253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:13, skipping insertion in model container [2019-11-15 23:44:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:12" (2/3) ... [2019-11-15 23:44:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697ef253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:13, skipping insertion in model container [2019-11-15 23:44:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:13" (3/3) ... [2019-11-15 23:44:13,202 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc.i [2019-11-15 23:44:13,253 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,254 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,254 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,254 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,254 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,254 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,255 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,256 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,257 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,258 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,258 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,258 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,258 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,259 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,259 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,259 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,259 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,259 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,260 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,261 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,262 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,262 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,263 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,264 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,265 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,266 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,267 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,268 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,269 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,270 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,271 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,272 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,273 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,274 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,275 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,276 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,277 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,279 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,279 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,280 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,280 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,280 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,280 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,281 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,281 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,282 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,283 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,290 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,291 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,292 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,293 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,294 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,295 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,296 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,297 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:44:13,305 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:44:13,305 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:44:13,312 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:44:13,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:44:13,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:44:13,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:44:13,342 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:44:13,342 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:44:13,342 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:44:13,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:44:13,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:44:13,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:44:13,359 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-11-15 23:44:15,847 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-11-15 23:44:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-11-15 23:44:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:44:15,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:15,857 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-15 23:44:15,858 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 406875446, now seen corresponding path program 1 times [2019-11-15 23:44:15,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:15,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568207343] [2019-11-15 23:44:15,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:15,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:15,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:16,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568207343] [2019-11-15 23:44:16,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:16,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:16,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827280812] [2019-11-15 23:44:16,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:16,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:16,139 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-11-15 23:44:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:16,981 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-11-15 23:44:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:16,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:44:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:17,242 INFO L225 Difference]: With dead ends: 33591 [2019-11-15 23:44:17,242 INFO L226 Difference]: Without dead ends: 25703 [2019-11-15 23:44:17,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-11-15 23:44:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-11-15 23:44:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-11-15 23:44:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-11-15 23:44:18,824 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-11-15 23:44:18,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:18,825 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-11-15 23:44:18,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-11-15 23:44:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:44:18,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:18,835 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-15 23:44:18,835 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash -92700470, now seen corresponding path program 1 times [2019-11-15 23:44:18,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:18,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967256232] [2019-11-15 23:44:18,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:18,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967256232] [2019-11-15 23:44:18,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:18,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:18,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970035763] [2019-11-15 23:44:18,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:18,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:18,960 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-11-15 23:44:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:20,140 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-11-15 23:44:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:20,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:44:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:20,308 INFO L225 Difference]: With dead ends: 41081 [2019-11-15 23:44:20,308 INFO L226 Difference]: Without dead ends: 40545 [2019-11-15 23:44:20,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-11-15 23:44:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-11-15 23:44:21,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-11-15 23:44:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-11-15 23:44:22,013 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-11-15 23:44:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:22,016 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-11-15 23:44:22,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-11-15 23:44:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:44:22,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:22,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:22,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:22,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:22,026 INFO L82 PathProgramCache]: Analyzing trace with hash 641615998, now seen corresponding path program 1 times [2019-11-15 23:44:22,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:22,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685223986] [2019-11-15 23:44:22,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:22,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685223986] [2019-11-15 23:44:22,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:22,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:22,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217691957] [2019-11-15 23:44:22,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:22,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:22,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:22,181 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-11-15 23:44:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:22,844 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-11-15 23:44:22,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:22,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:44:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:23,162 INFO L225 Difference]: With dead ends: 49778 [2019-11-15 23:44:23,163 INFO L226 Difference]: Without dead ends: 49274 [2019-11-15 23:44:23,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-11-15 23:44:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-11-15 23:44:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-11-15 23:44:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-11-15 23:44:24,940 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-11-15 23:44:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:24,941 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-11-15 23:44:24,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-11-15 23:44:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:44:24,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:24,949 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-15 23:44:24,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash -911086108, now seen corresponding path program 1 times [2019-11-15 23:44:24,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:24,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116598560] [2019-11-15 23:44:24,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:24,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:24,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:24,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116598560] [2019-11-15 23:44:24,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:24,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:24,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198844197] [2019-11-15 23:44:24,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:24,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:24,999 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-11-15 23:44:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:26,004 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-11-15 23:44:26,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:26,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:44:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:26,166 INFO L225 Difference]: With dead ends: 61087 [2019-11-15 23:44:26,166 INFO L226 Difference]: Without dead ends: 61087 [2019-11-15 23:44:26,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-11-15 23:44:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-11-15 23:44:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-11-15 23:44:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-11-15 23:44:27,116 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-11-15 23:44:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:27,116 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-11-15 23:44:27,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-11-15 23:44:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:27,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:27,132 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-15 23:44:27,132 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash -353012429, now seen corresponding path program 1 times [2019-11-15 23:44:27,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:27,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506999779] [2019-11-15 23:44:27,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:27,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506999779] [2019-11-15 23:44:27,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:27,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:27,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320294727] [2019-11-15 23:44:27,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:27,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:27,272 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 6 states. [2019-11-15 23:44:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:28,194 INFO L93 Difference]: Finished difference Result 63756 states and 229379 transitions. [2019-11-15 23:44:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:28,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:44:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:28,351 INFO L225 Difference]: With dead ends: 63756 [2019-11-15 23:44:28,351 INFO L226 Difference]: Without dead ends: 63756 [2019-11-15 23:44:28,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63756 states. [2019-11-15 23:44:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63756 to 59949. [2019-11-15 23:44:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-11-15 23:44:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-11-15 23:44:30,127 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-11-15 23:44:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:30,127 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-11-15 23:44:30,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-11-15 23:44:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:30,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:30,145 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-15 23:44:30,145 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2145003508, now seen corresponding path program 1 times [2019-11-15 23:44:30,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:30,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373385343] [2019-11-15 23:44:30,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:30,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:30,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:30,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373385343] [2019-11-15 23:44:30,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:30,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:30,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142206883] [2019-11-15 23:44:30,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:30,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:30,249 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-11-15 23:44:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:31,366 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-11-15 23:44:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:31,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-15 23:44:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:32,186 INFO L225 Difference]: With dead ends: 83685 [2019-11-15 23:44:32,186 INFO L226 Difference]: Without dead ends: 83685 [2019-11-15 23:44:32,187 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-11-15 23:44:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-11-15 23:44:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-11-15 23:44:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-11-15 23:44:33,425 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-11-15 23:44:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:33,425 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-11-15 23:44:33,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-11-15 23:44:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:33,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:33,440 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-15 23:44:33,440 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:33,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1262460107, now seen corresponding path program 1 times [2019-11-15 23:44:33,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:33,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768596512] [2019-11-15 23:44:33,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:33,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:33,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:33,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768596512] [2019-11-15 23:44:33,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:33,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:33,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151597798] [2019-11-15 23:44:33,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:33,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:33,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:33,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:33,526 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 4 states. [2019-11-15 23:44:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:33,598 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-11-15 23:44:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:33,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 23:44:33,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:33,617 INFO L225 Difference]: With dead ends: 12159 [2019-11-15 23:44:33,617 INFO L226 Difference]: Without dead ends: 10674 [2019-11-15 23:44:33,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-11-15 23:44:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-11-15 23:44:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-11-15 23:44:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-11-15 23:44:33,754 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-11-15 23:44:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:33,755 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-11-15 23:44:33,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-11-15 23:44:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:44:33,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:33,756 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-15 23:44:33,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 348030127, now seen corresponding path program 1 times [2019-11-15 23:44:33,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:33,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497567793] [2019-11-15 23:44:33,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:33,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:33,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:33,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497567793] [2019-11-15 23:44:33,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:33,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:33,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091769304] [2019-11-15 23:44:33,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:33,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:33,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:33,834 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-11-15 23:44:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:34,319 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-11-15 23:44:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:34,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 23:44:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:34,342 INFO L225 Difference]: With dead ends: 13182 [2019-11-15 23:44:34,342 INFO L226 Difference]: Without dead ends: 13119 [2019-11-15 23:44:34,343 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-15 23:44:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-11-15 23:44:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-11-15 23:44:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-11-15 23:44:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-11-15 23:44:34,522 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-11-15 23:44:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:34,522 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-11-15 23:44:34,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-11-15 23:44:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:44:34,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:34,525 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-15 23:44:34,526 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1800830091, now seen corresponding path program 1 times [2019-11-15 23:44:34,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:34,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334094317] [2019-11-15 23:44:34,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:34,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334094317] [2019-11-15 23:44:34,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:34,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:34,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779166997] [2019-11-15 23:44:34,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:34,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:34,578 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-11-15 23:44:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:34,715 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-11-15 23:44:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:34,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 23:44:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:34,733 INFO L225 Difference]: With dead ends: 12862 [2019-11-15 23:44:34,733 INFO L226 Difference]: Without dead ends: 12862 [2019-11-15 23:44:34,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-11-15 23:44:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-11-15 23:44:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-11-15 23:44:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-11-15 23:44:34,892 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-11-15 23:44:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:34,893 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-11-15 23:44:34,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-11-15 23:44:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 23:44:34,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:34,896 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-15 23:44:34,896 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash -751326870, now seen corresponding path program 1 times [2019-11-15 23:44:34,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:34,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905703341] [2019-11-15 23:44:34,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:34,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:34,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905703341] [2019-11-15 23:44:34,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:34,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:34,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242976512] [2019-11-15 23:44:34,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:34,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:34,973 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-11-15 23:44:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:35,450 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-11-15 23:44:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:35,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 23:44:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:35,467 INFO L225 Difference]: With dead ends: 14219 [2019-11-15 23:44:35,467 INFO L226 Difference]: Without dead ends: 14158 [2019-11-15 23:44:35,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:44:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-11-15 23:44:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-11-15 23:44:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-11-15 23:44:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-11-15 23:44:35,627 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-11-15 23:44:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:35,628 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-11-15 23:44:35,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-11-15 23:44:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:44:35,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:35,633 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-15 23:44:35,633 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1854971814, now seen corresponding path program 1 times [2019-11-15 23:44:35,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:35,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645930694] [2019-11-15 23:44:35,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:35,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:35,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:35,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645930694] [2019-11-15 23:44:35,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:35,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:35,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449208079] [2019-11-15 23:44:35,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:35,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:35,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:35,672 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-11-15 23:44:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:36,098 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-11-15 23:44:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:36,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:44:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:36,130 INFO L225 Difference]: With dead ends: 18895 [2019-11-15 23:44:36,130 INFO L226 Difference]: Without dead ends: 18847 [2019-11-15 23:44:36,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-11-15 23:44:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-11-15 23:44:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-11-15 23:44:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-11-15 23:44:36,372 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-11-15 23:44:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:36,372 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-11-15 23:44:36,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-11-15 23:44:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:44:36,378 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:36,378 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-15 23:44:36,379 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash -859031441, now seen corresponding path program 1 times [2019-11-15 23:44:36,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:36,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526590860] [2019-11-15 23:44:36,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:36,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:36,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:36,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526590860] [2019-11-15 23:44:36,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:36,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:36,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510181953] [2019-11-15 23:44:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:36,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:36,462 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-11-15 23:44:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:36,755 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-11-15 23:44:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:36,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:44:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:36,778 INFO L225 Difference]: With dead ends: 18169 [2019-11-15 23:44:36,779 INFO L226 Difference]: Without dead ends: 18169 [2019-11-15 23:44:36,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-11-15 23:44:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-11-15 23:44:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-11-15 23:44:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-11-15 23:44:36,972 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-11-15 23:44:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:36,972 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-11-15 23:44:36,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-11-15 23:44:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:44:36,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:36,978 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-15 23:44:36,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash -828011634, now seen corresponding path program 1 times [2019-11-15 23:44:36,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:36,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788564456] [2019-11-15 23:44:36,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:36,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:36,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:37,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788564456] [2019-11-15 23:44:37,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:37,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:37,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8956283] [2019-11-15 23:44:37,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:37,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:37,018 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-11-15 23:44:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:37,265 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-11-15 23:44:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:37,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-15 23:44:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:37,284 INFO L225 Difference]: With dead ends: 15542 [2019-11-15 23:44:37,284 INFO L226 Difference]: Without dead ends: 15542 [2019-11-15 23:44:37,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:37,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-11-15 23:44:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-11-15 23:44:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-11-15 23:44:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-11-15 23:44:37,461 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-11-15 23:44:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-11-15 23:44:37,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-11-15 23:44:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:37,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:37,468 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-15 23:44:37,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1228623168, now seen corresponding path program 1 times [2019-11-15 23:44:37,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:37,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988364849] [2019-11-15 23:44:37,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:37,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:37,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:37,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988364849] [2019-11-15 23:44:37,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:37,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:37,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200967447] [2019-11-15 23:44:37,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:37,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:37,563 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-11-15 23:44:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:38,010 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-11-15 23:44:38,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:38,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:44:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:38,037 INFO L225 Difference]: With dead ends: 16701 [2019-11-15 23:44:38,037 INFO L226 Difference]: Without dead ends: 16701 [2019-11-15 23:44:38,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-11-15 23:44:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-11-15 23:44:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-11-15 23:44:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-11-15 23:44:38,292 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-11-15 23:44:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:38,292 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-11-15 23:44:38,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-11-15 23:44:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:38,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:38,301 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-15 23:44:38,301 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1028287839, now seen corresponding path program 1 times [2019-11-15 23:44:38,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:38,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745772946] [2019-11-15 23:44:38,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:38,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:38,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:38,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745772946] [2019-11-15 23:44:38,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:38,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:38,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182408466] [2019-11-15 23:44:38,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:38,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:38,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:38,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:38,380 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-11-15 23:44:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:38,772 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-11-15 23:44:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:38,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:44:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:38,796 INFO L225 Difference]: With dead ends: 19681 [2019-11-15 23:44:38,796 INFO L226 Difference]: Without dead ends: 19681 [2019-11-15 23:44:38,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-11-15 23:44:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-11-15 23:44:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-11-15 23:44:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-11-15 23:44:39,013 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-11-15 23:44:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-11-15 23:44:39,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-11-15 23:44:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:39,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:39,022 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-15 23:44:39,022 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:39,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 517753662, now seen corresponding path program 1 times [2019-11-15 23:44:39,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:39,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944841366] [2019-11-15 23:44:39,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:39,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:39,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:39,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944841366] [2019-11-15 23:44:39,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:39,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:39,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994866149] [2019-11-15 23:44:39,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:39,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:39,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:39,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:39,096 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-11-15 23:44:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:39,691 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-11-15 23:44:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:39,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:44:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:39,724 INFO L225 Difference]: With dead ends: 26550 [2019-11-15 23:44:39,724 INFO L226 Difference]: Without dead ends: 26550 [2019-11-15 23:44:39,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-11-15 23:44:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-11-15 23:44:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-11-15 23:44:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-11-15 23:44:40,002 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-11-15 23:44:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:40,002 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-11-15 23:44:40,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-11-15 23:44:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:40,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:40,012 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-15 23:44:40,012 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1289700801, now seen corresponding path program 1 times [2019-11-15 23:44:40,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:40,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344893582] [2019-11-15 23:44:40,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:40,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:40,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:40,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344893582] [2019-11-15 23:44:40,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:40,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:40,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821114791] [2019-11-15 23:44:40,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:40,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:40,097 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 6 states. [2019-11-15 23:44:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:40,911 INFO L93 Difference]: Finished difference Result 34017 states and 98780 transitions. [2019-11-15 23:44:40,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:44:40,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-15 23:44:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:40,954 INFO L225 Difference]: With dead ends: 34017 [2019-11-15 23:44:40,954 INFO L226 Difference]: Without dead ends: 34017 [2019-11-15 23:44:40,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34017 states. [2019-11-15 23:44:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34017 to 27705. [2019-11-15 23:44:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27705 states. [2019-11-15 23:44:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27705 states to 27705 states and 81222 transitions. [2019-11-15 23:44:41,332 INFO L78 Accepts]: Start accepts. Automaton has 27705 states and 81222 transitions. Word has length 67 [2019-11-15 23:44:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:41,332 INFO L462 AbstractCegarLoop]: Abstraction has 27705 states and 81222 transitions. [2019-11-15 23:44:41,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27705 states and 81222 transitions. [2019-11-15 23:44:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:41,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:41,340 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-15 23:44:41,340 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -402197120, now seen corresponding path program 1 times [2019-11-15 23:44:41,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:41,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148425548] [2019-11-15 23:44:41,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:41,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148425548] [2019-11-15 23:44:41,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:41,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:41,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859695558] [2019-11-15 23:44:41,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:41,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:41,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:41,419 INFO L87 Difference]: Start difference. First operand 27705 states and 81222 transitions. Second operand 5 states. [2019-11-15 23:44:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:41,468 INFO L93 Difference]: Finished difference Result 7023 states and 16764 transitions. [2019-11-15 23:44:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:41,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-15 23:44:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:41,473 INFO L225 Difference]: With dead ends: 7023 [2019-11-15 23:44:41,473 INFO L226 Difference]: Without dead ends: 5715 [2019-11-15 23:44:41,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5715 states. [2019-11-15 23:44:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5715 to 4458. [2019-11-15 23:44:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4458 states. [2019-11-15 23:44:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 10498 transitions. [2019-11-15 23:44:41,516 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 10498 transitions. Word has length 67 [2019-11-15 23:44:41,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:41,517 INFO L462 AbstractCegarLoop]: Abstraction has 4458 states and 10498 transitions. [2019-11-15 23:44:41,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 10498 transitions. [2019-11-15 23:44:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:44:41,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:41,519 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-15 23:44:41,520 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash 27147227, now seen corresponding path program 1 times [2019-11-15 23:44:41,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:41,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448584754] [2019-11-15 23:44:41,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:41,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448584754] [2019-11-15 23:44:41,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:41,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:41,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562575851] [2019-11-15 23:44:41,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:41,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:41,569 INFO L87 Difference]: Start difference. First operand 4458 states and 10498 transitions. Second operand 3 states. [2019-11-15 23:44:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:41,606 INFO L93 Difference]: Finished difference Result 5989 states and 13972 transitions. [2019-11-15 23:44:41,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:41,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:44:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:41,613 INFO L225 Difference]: With dead ends: 5989 [2019-11-15 23:44:41,614 INFO L226 Difference]: Without dead ends: 5989 [2019-11-15 23:44:41,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2019-11-15 23:44:41,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 4401. [2019-11-15 23:44:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4401 states. [2019-11-15 23:44:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 10145 transitions. [2019-11-15 23:44:41,678 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 10145 transitions. Word has length 67 [2019-11-15 23:44:41,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:41,678 INFO L462 AbstractCegarLoop]: Abstraction has 4401 states and 10145 transitions. [2019-11-15 23:44:41,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 10145 transitions. [2019-11-15 23:44:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:44:41,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:41,683 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-15 23:44:41,683 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1559333934, now seen corresponding path program 1 times [2019-11-15 23:44:41,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:41,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072587732] [2019-11-15 23:44:41,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:41,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:41,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072587732] [2019-11-15 23:44:41,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:41,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:41,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948398353] [2019-11-15 23:44:41,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:41,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:41,745 INFO L87 Difference]: Start difference. First operand 4401 states and 10145 transitions. Second operand 5 states. [2019-11-15 23:44:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:41,940 INFO L93 Difference]: Finished difference Result 5368 states and 12376 transitions. [2019-11-15 23:44:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:41,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-15 23:44:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:41,946 INFO L225 Difference]: With dead ends: 5368 [2019-11-15 23:44:41,947 INFO L226 Difference]: Without dead ends: 5368 [2019-11-15 23:44:41,947 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-15 23:44:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2019-11-15 23:44:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 4787. [2019-11-15 23:44:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4787 states. [2019-11-15 23:44:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4787 states to 4787 states and 11034 transitions. [2019-11-15 23:44:42,009 INFO L78 Accepts]: Start accepts. Automaton has 4787 states and 11034 transitions. Word has length 73 [2019-11-15 23:44:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:42,010 INFO L462 AbstractCegarLoop]: Abstraction has 4787 states and 11034 transitions. [2019-11-15 23:44:42,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4787 states and 11034 transitions. [2019-11-15 23:44:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:44:42,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:42,015 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-15 23:44:42,015 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash -992823027, now seen corresponding path program 1 times [2019-11-15 23:44:42,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:42,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85525237] [2019-11-15 23:44:42,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:42,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85525237] [2019-11-15 23:44:42,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:42,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:42,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148548993] [2019-11-15 23:44:42,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:42,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:42,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:42,085 INFO L87 Difference]: Start difference. First operand 4787 states and 11034 transitions. Second operand 7 states. [2019-11-15 23:44:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:42,414 INFO L93 Difference]: Finished difference Result 5716 states and 13034 transitions. [2019-11-15 23:44:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:44:42,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-15 23:44:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:42,418 INFO L225 Difference]: With dead ends: 5716 [2019-11-15 23:44:42,419 INFO L226 Difference]: Without dead ends: 5663 [2019-11-15 23:44:42,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:44:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2019-11-15 23:44:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 4845. [2019-11-15 23:44:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2019-11-15 23:44:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 11083 transitions. [2019-11-15 23:44:42,463 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 11083 transitions. Word has length 73 [2019-11-15 23:44:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:42,463 INFO L462 AbstractCegarLoop]: Abstraction has 4845 states and 11083 transitions. [2019-11-15 23:44:42,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 11083 transitions. [2019-11-15 23:44:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:44:42,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:42,468 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] [2019-11-15 23:44:42,468 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -59409135, now seen corresponding path program 1 times [2019-11-15 23:44:42,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:42,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979508592] [2019-11-15 23:44:42,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:42,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979508592] [2019-11-15 23:44:42,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:42,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:42,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759649245] [2019-11-15 23:44:42,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:44:42,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:44:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:42,519 INFO L87 Difference]: Start difference. First operand 4845 states and 11083 transitions. Second operand 3 states. [2019-11-15 23:44:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:42,697 INFO L93 Difference]: Finished difference Result 6469 states and 14402 transitions. [2019-11-15 23:44:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:44:42,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 23:44:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:42,704 INFO L225 Difference]: With dead ends: 6469 [2019-11-15 23:44:42,704 INFO L226 Difference]: Without dead ends: 6178 [2019-11-15 23:44:42,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:44:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-11-15 23:44:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5679. [2019-11-15 23:44:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-11-15 23:44:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 12809 transitions. [2019-11-15 23:44:42,777 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 12809 transitions. Word has length 92 [2019-11-15 23:44:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:42,777 INFO L462 AbstractCegarLoop]: Abstraction has 5679 states and 12809 transitions. [2019-11-15 23:44:42,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:44:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 12809 transitions. [2019-11-15 23:44:42,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:44:42,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:42,783 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] [2019-11-15 23:44:42,783 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash -220780907, now seen corresponding path program 1 times [2019-11-15 23:44:42,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:42,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540440847] [2019-11-15 23:44:42,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:42,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:42,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540440847] [2019-11-15 23:44:42,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:42,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:42,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590036968] [2019-11-15 23:44:42,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:42,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:42,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:42,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:42,866 INFO L87 Difference]: Start difference. First operand 5679 states and 12809 transitions. Second operand 4 states. [2019-11-15 23:44:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:42,988 INFO L93 Difference]: Finished difference Result 6037 states and 13652 transitions. [2019-11-15 23:44:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:42,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:44:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:42,992 INFO L225 Difference]: With dead ends: 6037 [2019-11-15 23:44:42,992 INFO L226 Difference]: Without dead ends: 6037 [2019-11-15 23:44:42,993 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-15 23:44:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2019-11-15 23:44:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 5624. [2019-11-15 23:44:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5624 states. [2019-11-15 23:44:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5624 states to 5624 states and 12768 transitions. [2019-11-15 23:44:43,045 INFO L78 Accepts]: Start accepts. Automaton has 5624 states and 12768 transitions. Word has length 92 [2019-11-15 23:44:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:43,046 INFO L462 AbstractCegarLoop]: Abstraction has 5624 states and 12768 transitions. [2019-11-15 23:44:43,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5624 states and 12768 transitions. [2019-11-15 23:44:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:43,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:43,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:43,058 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -560822665, now seen corresponding path program 1 times [2019-11-15 23:44:43,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:43,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301728816] [2019-11-15 23:44:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:43,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:43,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:43,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301728816] [2019-11-15 23:44:43,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:43,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:43,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398310818] [2019-11-15 23:44:43,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:43,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:43,120 INFO L87 Difference]: Start difference. First operand 5624 states and 12768 transitions. Second operand 5 states. [2019-11-15 23:44:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:43,257 INFO L93 Difference]: Finished difference Result 6533 states and 14749 transitions. [2019-11-15 23:44:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:43,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 23:44:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:43,264 INFO L225 Difference]: With dead ends: 6533 [2019-11-15 23:44:43,265 INFO L226 Difference]: Without dead ends: 6533 [2019-11-15 23:44:43,265 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-15 23:44:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6533 states. [2019-11-15 23:44:43,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6533 to 5038. [2019-11-15 23:44:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5038 states. [2019-11-15 23:44:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5038 states to 5038 states and 11419 transitions. [2019-11-15 23:44:43,333 INFO L78 Accepts]: Start accepts. Automaton has 5038 states and 11419 transitions. Word has length 94 [2019-11-15 23:44:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:43,334 INFO L462 AbstractCegarLoop]: Abstraction has 5038 states and 11419 transitions. [2019-11-15 23:44:43,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5038 states and 11419 transitions. [2019-11-15 23:44:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:43,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:43,340 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-15 23:44:43,340 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:43,340 INFO L82 PathProgramCache]: Analyzing trace with hash -815559210, now seen corresponding path program 1 times [2019-11-15 23:44:43,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:43,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659526316] [2019-11-15 23:44:43,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:43,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:43,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:43,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659526316] [2019-11-15 23:44:43,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:43,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:43,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046994585] [2019-11-15 23:44:43,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:43,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:43,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:43,396 INFO L87 Difference]: Start difference. First operand 5038 states and 11419 transitions. Second operand 5 states. [2019-11-15 23:44:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:43,915 INFO L93 Difference]: Finished difference Result 8161 states and 18517 transitions. [2019-11-15 23:44:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:43,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-15 23:44:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:43,924 INFO L225 Difference]: With dead ends: 8161 [2019-11-15 23:44:43,925 INFO L226 Difference]: Without dead ends: 8147 [2019-11-15 23:44:43,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8147 states. [2019-11-15 23:44:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8147 to 5817. [2019-11-15 23:44:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5817 states. [2019-11-15 23:44:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5817 states to 5817 states and 13250 transitions. [2019-11-15 23:44:44,011 INFO L78 Accepts]: Start accepts. Automaton has 5817 states and 13250 transitions. Word has length 94 [2019-11-15 23:44:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:44,011 INFO L462 AbstractCegarLoop]: Abstraction has 5817 states and 13250 transitions. [2019-11-15 23:44:44,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5817 states and 13250 transitions. [2019-11-15 23:44:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:44,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:44,018 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-15 23:44:44,018 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash 429205271, now seen corresponding path program 1 times [2019-11-15 23:44:44,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:44,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408496730] [2019-11-15 23:44:44,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:44,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408496730] [2019-11-15 23:44:44,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:44,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:44,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045809982] [2019-11-15 23:44:44,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:44,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:44,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:44,089 INFO L87 Difference]: Start difference. First operand 5817 states and 13250 transitions. Second operand 6 states. [2019-11-15 23:44:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:44,486 INFO L93 Difference]: Finished difference Result 7706 states and 17284 transitions. [2019-11-15 23:44:44,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:44:44,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 23:44:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:44,495 INFO L225 Difference]: With dead ends: 7706 [2019-11-15 23:44:44,495 INFO L226 Difference]: Without dead ends: 7706 [2019-11-15 23:44:44,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:44:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7706 states. [2019-11-15 23:44:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7706 to 5929. [2019-11-15 23:44:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-11-15 23:44:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 13386 transitions. [2019-11-15 23:44:44,585 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 13386 transitions. Word has length 94 [2019-11-15 23:44:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:44,585 INFO L462 AbstractCegarLoop]: Abstraction has 5929 states and 13386 transitions. [2019-11-15 23:44:44,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 13386 transitions. [2019-11-15 23:44:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:44,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:44,594 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-15 23:44:44,594 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:44,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2028129972, now seen corresponding path program 1 times [2019-11-15 23:44:44,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:44,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533613005] [2019-11-15 23:44:44,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:44,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:44,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533613005] [2019-11-15 23:44:44,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:44,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:44,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389903839] [2019-11-15 23:44:44,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:44,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:44,793 INFO L87 Difference]: Start difference. First operand 5929 states and 13386 transitions. Second operand 7 states. [2019-11-15 23:44:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:45,072 INFO L93 Difference]: Finished difference Result 7798 states and 17354 transitions. [2019-11-15 23:44:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:45,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 23:44:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:45,079 INFO L225 Difference]: With dead ends: 7798 [2019-11-15 23:44:45,079 INFO L226 Difference]: Without dead ends: 7700 [2019-11-15 23:44:45,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2019-11-15 23:44:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 6379. [2019-11-15 23:44:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-11-15 23:44:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 14329 transitions. [2019-11-15 23:44:45,162 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 14329 transitions. Word has length 94 [2019-11-15 23:44:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:45,162 INFO L462 AbstractCegarLoop]: Abstraction has 6379 states and 14329 transitions. [2019-11-15 23:44:45,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 14329 transitions. [2019-11-15 23:44:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:45,171 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:45,171 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-15 23:44:45,171 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1997110165, now seen corresponding path program 1 times [2019-11-15 23:44:45,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:45,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718242461] [2019-11-15 23:44:45,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:45,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:45,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:45,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718242461] [2019-11-15 23:44:45,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:45,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:44:45,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067409997] [2019-11-15 23:44:45,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:45,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:45,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:45,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:45,320 INFO L87 Difference]: Start difference. First operand 6379 states and 14329 transitions. Second operand 9 states. [2019-11-15 23:44:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:45,829 INFO L93 Difference]: Finished difference Result 9038 states and 20205 transitions. [2019-11-15 23:44:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:44:45,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-11-15 23:44:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:45,836 INFO L225 Difference]: With dead ends: 9038 [2019-11-15 23:44:45,836 INFO L226 Difference]: Without dead ends: 9002 [2019-11-15 23:44:45,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:44:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9002 states. [2019-11-15 23:44:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9002 to 8159. [2019-11-15 23:44:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8159 states. [2019-11-15 23:44:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8159 states to 8159 states and 18283 transitions. [2019-11-15 23:44:45,912 INFO L78 Accepts]: Start accepts. Automaton has 8159 states and 18283 transitions. Word has length 94 [2019-11-15 23:44:45,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:45,913 INFO L462 AbstractCegarLoop]: Abstraction has 8159 states and 18283 transitions. [2019-11-15 23:44:45,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8159 states and 18283 transitions. [2019-11-15 23:44:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:45,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:45,921 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-15 23:44:45,921 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:45,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash 500905772, now seen corresponding path program 1 times [2019-11-15 23:44:45,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:45,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273383461] [2019-11-15 23:44:45,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:45,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:45,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:46,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273383461] [2019-11-15 23:44:46,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:46,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:46,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296930132] [2019-11-15 23:44:46,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:46,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:46,026 INFO L87 Difference]: Start difference. First operand 8159 states and 18283 transitions. Second operand 7 states. [2019-11-15 23:44:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:46,566 INFO L93 Difference]: Finished difference Result 11919 states and 26691 transitions. [2019-11-15 23:44:46,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:44:46,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 23:44:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:46,579 INFO L225 Difference]: With dead ends: 11919 [2019-11-15 23:44:46,579 INFO L226 Difference]: Without dead ends: 11919 [2019-11-15 23:44:46,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:44:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11919 states. [2019-11-15 23:44:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11919 to 8573. [2019-11-15 23:44:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2019-11-15 23:44:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 19368 transitions. [2019-11-15 23:44:46,767 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 19368 transitions. Word has length 94 [2019-11-15 23:44:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:46,767 INFO L462 AbstractCegarLoop]: Abstraction has 8573 states and 19368 transitions. [2019-11-15 23:44:46,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 19368 transitions. [2019-11-15 23:44:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:46,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:46,776 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-15 23:44:46,776 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1388409453, now seen corresponding path program 1 times [2019-11-15 23:44:46,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:46,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345978044] [2019-11-15 23:44:46,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:46,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:46,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:46,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345978044] [2019-11-15 23:44:46,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:46,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:46,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984335385] [2019-11-15 23:44:46,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:44:46,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:44:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:44:46,899 INFO L87 Difference]: Start difference. First operand 8573 states and 19368 transitions. Second operand 7 states. [2019-11-15 23:44:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:47,073 INFO L93 Difference]: Finished difference Result 11367 states and 25685 transitions. [2019-11-15 23:44:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:47,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-15 23:44:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:47,085 INFO L225 Difference]: With dead ends: 11367 [2019-11-15 23:44:47,086 INFO L226 Difference]: Without dead ends: 11367 [2019-11-15 23:44:47,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2019-11-15 23:44:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 8007. [2019-11-15 23:44:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8007 states. [2019-11-15 23:44:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8007 states to 8007 states and 17964 transitions. [2019-11-15 23:44:47,206 INFO L78 Accepts]: Start accepts. Automaton has 8007 states and 17964 transitions. Word has length 94 [2019-11-15 23:44:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:47,207 INFO L462 AbstractCegarLoop]: Abstraction has 8007 states and 17964 transitions. [2019-11-15 23:44:47,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:44:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8007 states and 17964 transitions. [2019-11-15 23:44:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:47,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:47,215 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-15 23:44:47,215 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash 543937582, now seen corresponding path program 1 times [2019-11-15 23:44:47,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:47,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899189989] [2019-11-15 23:44:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:47,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899189989] [2019-11-15 23:44:47,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:47,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:47,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52804448] [2019-11-15 23:44:47,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:47,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:47,318 INFO L87 Difference]: Start difference. First operand 8007 states and 17964 transitions. Second operand 6 states. [2019-11-15 23:44:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:47,386 INFO L93 Difference]: Finished difference Result 9236 states and 20421 transitions. [2019-11-15 23:44:47,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:47,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 23:44:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:47,396 INFO L225 Difference]: With dead ends: 9236 [2019-11-15 23:44:47,396 INFO L226 Difference]: Without dead ends: 9236 [2019-11-15 23:44:47,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9236 states. [2019-11-15 23:44:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9236 to 7825. [2019-11-15 23:44:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7825 states. [2019-11-15 23:44:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7825 states to 7825 states and 17307 transitions. [2019-11-15 23:44:47,500 INFO L78 Accepts]: Start accepts. Automaton has 7825 states and 17307 transitions. Word has length 94 [2019-11-15 23:44:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:47,501 INFO L462 AbstractCegarLoop]: Abstraction has 7825 states and 17307 transitions. [2019-11-15 23:44:47,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 7825 states and 17307 transitions. [2019-11-15 23:44:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:44:47,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:47,509 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-15 23:44:47,509 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash 901198382, now seen corresponding path program 1 times [2019-11-15 23:44:47,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:47,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039420803] [2019-11-15 23:44:47,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:47,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039420803] [2019-11-15 23:44:47,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:47,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:44:47,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998045851] [2019-11-15 23:44:47,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:47,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:47,603 INFO L87 Difference]: Start difference. First operand 7825 states and 17307 transitions. Second operand 6 states. [2019-11-15 23:44:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:47,764 INFO L93 Difference]: Finished difference Result 7591 states and 16617 transitions. [2019-11-15 23:44:47,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:47,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-15 23:44:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:47,772 INFO L225 Difference]: With dead ends: 7591 [2019-11-15 23:44:47,773 INFO L226 Difference]: Without dead ends: 7591 [2019-11-15 23:44:47,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2019-11-15 23:44:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 4852. [2019-11-15 23:44:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2019-11-15 23:44:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 10709 transitions. [2019-11-15 23:44:47,853 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 10709 transitions. Word has length 94 [2019-11-15 23:44:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:47,854 INFO L462 AbstractCegarLoop]: Abstraction has 4852 states and 10709 transitions. [2019-11-15 23:44:47,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 10709 transitions. [2019-11-15 23:44:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:44:47,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:47,859 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-15 23:44:47,859 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:47,859 INFO L82 PathProgramCache]: Analyzing trace with hash -404347776, now seen corresponding path program 1 times [2019-11-15 23:44:47,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:47,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245921632] [2019-11-15 23:44:47,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:47,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:48,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245921632] [2019-11-15 23:44:48,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:48,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:44:48,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844877625] [2019-11-15 23:44:48,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:48,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:48,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:48,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:48,036 INFO L87 Difference]: Start difference. First operand 4852 states and 10709 transitions. Second operand 9 states. [2019-11-15 23:44:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:48,552 INFO L93 Difference]: Finished difference Result 5819 states and 12713 transitions. [2019-11-15 23:44:48,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:44:48,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-11-15 23:44:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:48,556 INFO L225 Difference]: With dead ends: 5819 [2019-11-15 23:44:48,556 INFO L226 Difference]: Without dead ends: 5819 [2019-11-15 23:44:48,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:44:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2019-11-15 23:44:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5613. [2019-11-15 23:44:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5613 states. [2019-11-15 23:44:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5613 states to 5613 states and 12317 transitions. [2019-11-15 23:44:48,603 INFO L78 Accepts]: Start accepts. Automaton has 5613 states and 12317 transitions. Word has length 96 [2019-11-15 23:44:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:48,604 INFO L462 AbstractCegarLoop]: Abstraction has 5613 states and 12317 transitions. [2019-11-15 23:44:48,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 5613 states and 12317 transitions. [2019-11-15 23:44:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:44:48,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:48,608 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-15 23:44:48,608 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 483155905, now seen corresponding path program 1 times [2019-11-15 23:44:48,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:48,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720127306] [2019-11-15 23:44:48,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:48,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:48,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:48,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720127306] [2019-11-15 23:44:48,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:48,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:44:48,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535693456] [2019-11-15 23:44:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:44:48,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:48,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:44:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:48,791 INFO L87 Difference]: Start difference. First operand 5613 states and 12317 transitions. Second operand 10 states. [2019-11-15 23:44:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:49,569 INFO L93 Difference]: Finished difference Result 22827 states and 50531 transitions. [2019-11-15 23:44:49,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:44:49,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-11-15 23:44:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:49,584 INFO L225 Difference]: With dead ends: 22827 [2019-11-15 23:44:49,584 INFO L226 Difference]: Without dead ends: 13242 [2019-11-15 23:44:49,584 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-15 23:44:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2019-11-15 23:44:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 5359. [2019-11-15 23:44:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5359 states. [2019-11-15 23:44:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5359 states to 5359 states and 11655 transitions. [2019-11-15 23:44:49,696 INFO L78 Accepts]: Start accepts. Automaton has 5359 states and 11655 transitions. Word has length 96 [2019-11-15 23:44:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:49,697 INFO L462 AbstractCegarLoop]: Abstraction has 5359 states and 11655 transitions. [2019-11-15 23:44:49,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:44:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5359 states and 11655 transitions. [2019-11-15 23:44:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:44:49,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:49,702 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-15 23:44:49,703 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:44:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:49,703 INFO L82 PathProgramCache]: Analyzing trace with hash -337556635, now seen corresponding path program 2 times [2019-11-15 23:44:49,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:49,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267318394] [2019-11-15 23:44:49,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:49,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:49,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:44:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:44:49,798 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:44:49,799 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:44:49,969 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:44:49,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:44:49 BasicIcfg [2019-11-15 23:44:49,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:44:49,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:44:49,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:44:49,978 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:44:49,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:13" (3/4) ... [2019-11-15 23:44:49,983 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:44:50,125 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8a517756-5c3f-4096-8859-c9421af8d6bc/bin/uautomizer/witness.graphml [2019-11-15 23:44:50,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:44:50,127 INFO L168 Benchmark]: Toolchain (without parser) took 38392.09 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 939.3 MB 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-15 23:44:50,127 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:44:50,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:50,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.42 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:50,129 INFO L168 Benchmark]: Boogie Preprocessor took 55.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-15 23:44:50,129 INFO L168 Benchmark]: RCFGBuilder took 673.05 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:50,129 INFO L168 Benchmark]: TraceAbstraction took 36781.48 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 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.4 GB. Max. memory is 11.5 GB. [2019-11-15 23:44:50,130 INFO L168 Benchmark]: Witness Printer took 148.25 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:44:50,131 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 677.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.42 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.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 673.05 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36781.48 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 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.4 GB. Max. memory is 11.5 GB. * Witness Printer took 148.25 ms. Allocated memory is still 3.7 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 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] [L704] 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, y=0] [L706] 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, y=0, z=0] [L707] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L708] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L709] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L710] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L711] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L712] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L713] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L714] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L715] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L716] 0 int *z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L717] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L718] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L719] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L720] 0 _Bool z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 0 pthread_t t1089; 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t1089, ((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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L732] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L733] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t1090; 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t1090, ((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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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=2, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$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 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 2 z$flush_delayed ? z$mem_tmp : z 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=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z = z$flush_delayed ? z$mem_tmp : z [L776] 2 z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L779] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(x == 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 219 locations, 3 error locations. Result: UNSAFE, OverallTime: 36.6s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9634 SDtfs, 10267 SDslu, 22854 SDs, 0 SdLazy, 8061 SolverSat, 552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 102 SyntacticMatches, 19 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.6s 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.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 94814 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2441 ConstructedInterpolants, 0 QuantifiedInterpolants, 500768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...