./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt.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_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/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 530d9436aa4f4ef82834180462660e57d00a5021 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:00:32,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:00:32,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:00:32,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:00:32,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:00:32,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:00:32,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:00:32,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:00:32,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:00:32,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:00:32,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:00:32,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:00:32,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:00:32,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:00:32,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:00:32,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:00:32,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:00:32,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:00:32,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:00:32,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:00:32,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:00:32,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:00:32,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:00:32,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:00:32,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:00:32,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:00:32,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:00:32,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:00:32,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:00:32,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:00:32,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:00:32,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:00:32,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:00:32,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:00:32,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:00:32,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:00:32,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:00:32,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:00:32,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:00:32,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:00:32,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:00:32,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:00:32,858 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:00:32,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:00:32,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:00:32,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:00:32,860 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:00:32,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:00:32,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:00:32,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:00:32,862 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:00:32,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:00:32,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:00:32,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:00:32,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:00:32,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:00:32,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:00:32,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:00:32,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:00:32,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:00:32,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:00:32,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:00:32,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:00:32,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:00:32,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:00:32,865 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_a2c56dbb-f30f-462b-a257-ef1b982d5d79/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 -> 530d9436aa4f4ef82834180462660e57d00a5021 [2019-11-16 00:00:32,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:00:32,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:00:32,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:00:32,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:00:32,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:00:32,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt.i [2019-11-16 00:00:32,956 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/data/54565a687/c9e4ed0ca6434bc5b647c0fa6e2d8fc5/FLAG2d198763d [2019-11-16 00:00:33,461 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:00:33,465 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/sv-benchmarks/c/pthread-wmm/mix054_pso.opt.i [2019-11-16 00:00:33,481 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/data/54565a687/c9e4ed0ca6434bc5b647c0fa6e2d8fc5/FLAG2d198763d [2019-11-16 00:00:33,973 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/data/54565a687/c9e4ed0ca6434bc5b647c0fa6e2d8fc5 [2019-11-16 00:00:33,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:00:33,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:00:33,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:00:33,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:00:33,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:00:33,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:33" (1/1) ... [2019-11-16 00:00:33,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a3561c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:33, skipping insertion in model container [2019-11-16 00:00:33,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:00:33" (1/1) ... [2019-11-16 00:00:33,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:00:34,048 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:00:34,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:00:34,580 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:00:34,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:00:34,716 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:00:34,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34 WrapperNode [2019-11-16 00:00:34,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:00:34,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:00:34,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:00:34,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:00:34,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:00:34,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:00:34,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:00:34,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:00:34,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... [2019-11-16 00:00:34,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:00:34,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:00:34,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:00:34,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:00:34,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:00:34,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:00:34,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:00:34,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:00:34,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:00:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:00:34,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:00:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:00:34,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:00:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:00:34,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:00:34,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:00:34,909 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:00:35,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:00:35,595 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:00:35,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:00:35 BoogieIcfgContainer [2019-11-16 00:00:35,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:00:35,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:00:35,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:00:35,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:00:35,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:00:33" (1/3) ... [2019-11-16 00:00:35,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26be76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:35, skipping insertion in model container [2019-11-16 00:00:35,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:00:34" (2/3) ... [2019-11-16 00:00:35,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26be76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:00:35, skipping insertion in model container [2019-11-16 00:00:35,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:00:35" (3/3) ... [2019-11-16 00:00:35,603 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-11-16 00:00:35,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,659 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,659 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,659 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,660 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,661 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,661 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,661 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,661 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,661 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,662 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,663 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,664 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,665 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:00:35,676 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:00:35,676 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:00:35,683 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:00:35,692 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:00:35,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:00:35,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:00:35,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:00:35,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:00:35,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:00:35,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:00:35,710 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:00:35,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:00:35,722 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 177 transitions [2019-11-16 00:00:37,207 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-11-16 00:00:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-11-16 00:00:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:00:37,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:37,216 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] [2019-11-16 00:00:37,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1169224313, now seen corresponding path program 1 times [2019-11-16 00:00:37,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:37,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554992443] [2019-11-16 00:00:37,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:37,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:37,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:37,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554992443] [2019-11-16 00:00:37,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:37,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:37,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420613064] [2019-11-16 00:00:37,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:37,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:37,516 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-11-16 00:00:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:38,124 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-11-16 00:00:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:00:38,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-16 00:00:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:38,349 INFO L225 Difference]: With dead ends: 23445 [2019-11-16 00:00:38,349 INFO L226 Difference]: Without dead ends: 21269 [2019-11-16 00:00:38,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-11-16 00:00:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-11-16 00:00:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-11-16 00:00:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-11-16 00:00:39,637 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-11-16 00:00:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:39,637 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-11-16 00:00:39,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-11-16 00:00:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:00:39,647 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:39,650 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] [2019-11-16 00:00:39,650 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:39,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:39,651 INFO L82 PathProgramCache]: Analyzing trace with hash -388831628, now seen corresponding path program 1 times [2019-11-16 00:00:39,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:39,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891846085] [2019-11-16 00:00:39,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:39,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:39,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:39,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891846085] [2019-11-16 00:00:39,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:39,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:39,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312306564] [2019-11-16 00:00:39,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:39,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:39,804 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-11-16 00:00:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:40,520 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-11-16 00:00:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:00:40,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-16 00:00:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:40,666 INFO L225 Difference]: With dead ends: 34703 [2019-11-16 00:00:40,666 INFO L226 Difference]: Without dead ends: 34559 [2019-11-16 00:00:40,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:00:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-11-16 00:00:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-11-16 00:00:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-11-16 00:00:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-11-16 00:00:41,930 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-11-16 00:00:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:41,932 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-11-16 00:00:41,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-11-16 00:00:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:00:41,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:41,938 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] [2019-11-16 00:00:41,939 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:41,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:41,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2129278721, now seen corresponding path program 1 times [2019-11-16 00:00:41,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:41,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117334505] [2019-11-16 00:00:41,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:41,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:41,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:42,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117334505] [2019-11-16 00:00:42,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:42,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:42,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69540147] [2019-11-16 00:00:42,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:42,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:42,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:42,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:42,073 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-11-16 00:00:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:42,609 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-11-16 00:00:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:00:42,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:00:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:42,729 INFO L225 Difference]: With dead ends: 40211 [2019-11-16 00:00:42,729 INFO L226 Difference]: Without dead ends: 40051 [2019-11-16 00:00:42,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:00:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-11-16 00:00:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-11-16 00:00:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-11-16 00:00:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-11-16 00:00:44,075 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-11-16 00:00:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:44,076 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-11-16 00:00:44,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-11-16 00:00:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:00:44,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:44,090 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] [2019-11-16 00:00:44,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:44,091 INFO L82 PathProgramCache]: Analyzing trace with hash -736140046, now seen corresponding path program 1 times [2019-11-16 00:00:44,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:44,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660772619] [2019-11-16 00:00:44,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:44,091 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:44,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:44,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660772619] [2019-11-16 00:00:44,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:44,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:44,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057275433] [2019-11-16 00:00:44,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:44,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:44,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:44,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:44,210 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-11-16 00:00:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:45,708 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-11-16 00:00:45,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:00:45,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:00:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:45,807 INFO L225 Difference]: With dead ends: 45660 [2019-11-16 00:00:45,808 INFO L226 Difference]: Without dead ends: 45516 [2019-11-16 00:00:45,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:00:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-11-16 00:00:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-11-16 00:00:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-11-16 00:00:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-11-16 00:00:46,580 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-11-16 00:00:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:46,581 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-11-16 00:00:46,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-11-16 00:00:46,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:00:46,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:46,613 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] [2019-11-16 00:00:46,613 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 481645682, now seen corresponding path program 1 times [2019-11-16 00:00:46,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:46,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486201209] [2019-11-16 00:00:46,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:46,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:46,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:46,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486201209] [2019-11-16 00:00:46,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:46,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:00:46,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344480888] [2019-11-16 00:00:46,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:00:46,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:46,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:00:46,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:00:46,737 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-11-16 00:00:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:47,378 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-11-16 00:00:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:00:47,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-16 00:00:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:47,465 INFO L225 Difference]: With dead ends: 46067 [2019-11-16 00:00:47,465 INFO L226 Difference]: Without dead ends: 45827 [2019-11-16 00:00:47,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:00:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-11-16 00:00:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-11-16 00:00:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-11-16 00:00:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-11-16 00:00:48,620 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-11-16 00:00:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:48,621 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-11-16 00:00:48,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:00:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-11-16 00:00:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:00:48,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:48,655 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] [2019-11-16 00:00:48,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 751812519, now seen corresponding path program 1 times [2019-11-16 00:00:48,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:48,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032645342] [2019-11-16 00:00:48,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:48,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:48,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:48,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032645342] [2019-11-16 00:00:48,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:48,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:48,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899889871] [2019-11-16 00:00:48,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:48,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:48,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:48,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:48,703 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-11-16 00:00:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:48,900 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-11-16 00:00:48,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:48,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-16 00:00:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:48,995 INFO L225 Difference]: With dead ends: 50254 [2019-11-16 00:00:48,995 INFO L226 Difference]: Without dead ends: 50254 [2019-11-16 00:00:48,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-11-16 00:00:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-11-16 00:00:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-11-16 00:00:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-11-16 00:00:50,216 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-11-16 00:00:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:50,217 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-11-16 00:00:50,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-11-16 00:00:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:00:50,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:50,248 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:00:50,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1820538073, now seen corresponding path program 1 times [2019-11-16 00:00:50,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:50,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290929234] [2019-11-16 00:00:50,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:50,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:50,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:50,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290929234] [2019-11-16 00:00:50,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:50,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:50,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34877848] [2019-11-16 00:00:50,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:50,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:50,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:50,328 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-11-16 00:00:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:51,309 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-11-16 00:00:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:00:51,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-16 00:00:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:51,422 INFO L225 Difference]: With dead ends: 55882 [2019-11-16 00:00:51,422 INFO L226 Difference]: Without dead ends: 55642 [2019-11-16 00:00:51,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:00:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-11-16 00:00:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-11-16 00:00:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-11-16 00:00:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-11-16 00:00:52,215 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-11-16 00:00:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:52,216 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-11-16 00:00:52,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-11-16 00:00:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:00:52,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:52,250 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:00:52,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 278498085, now seen corresponding path program 1 times [2019-11-16 00:00:52,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:52,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781083269] [2019-11-16 00:00:52,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:52,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:52,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:52,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781083269] [2019-11-16 00:00:52,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:52,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:52,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105977213] [2019-11-16 00:00:52,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:52,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:52,311 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 5 states. [2019-11-16 00:00:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:53,922 INFO L93 Difference]: Finished difference Result 114994 states and 419362 transitions. [2019-11-16 00:00:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:00:53,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:00:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:54,155 INFO L225 Difference]: With dead ends: 114994 [2019-11-16 00:00:54,156 INFO L226 Difference]: Without dead ends: 114254 [2019-11-16 00:00:54,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:00:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114254 states. [2019-11-16 00:00:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114254 to 64567. [2019-11-16 00:00:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64567 states. [2019-11-16 00:00:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64567 states to 64567 states and 236504 transitions. [2019-11-16 00:00:55,552 INFO L78 Accepts]: Start accepts. Automaton has 64567 states and 236504 transitions. Word has length 65 [2019-11-16 00:00:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:55,552 INFO L462 AbstractCegarLoop]: Abstraction has 64567 states and 236504 transitions. [2019-11-16 00:00:55,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 64567 states and 236504 transitions. [2019-11-16 00:00:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:00:55,599 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:55,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:00:55,599 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1338404775, now seen corresponding path program 1 times [2019-11-16 00:00:55,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:55,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076215400] [2019-11-16 00:00:55,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:55,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:55,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:55,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076215400] [2019-11-16 00:00:55,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:55,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:00:55,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265324976] [2019-11-16 00:00:55,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:00:55,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:00:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:00:55,677 INFO L87 Difference]: Start difference. First operand 64567 states and 236504 transitions. Second operand 7 states. [2019-11-16 00:00:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:57,278 INFO L93 Difference]: Finished difference Result 74791 states and 270015 transitions. [2019-11-16 00:00:57,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:00:57,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:00:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:57,427 INFO L225 Difference]: With dead ends: 74791 [2019-11-16 00:00:57,427 INFO L226 Difference]: Without dead ends: 74591 [2019-11-16 00:00:57,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:00:57,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74591 states. [2019-11-16 00:00:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74591 to 65445. [2019-11-16 00:00:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65445 states. [2019-11-16 00:00:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65445 states to 65445 states and 239375 transitions. [2019-11-16 00:00:58,534 INFO L78 Accepts]: Start accepts. Automaton has 65445 states and 239375 transitions. Word has length 65 [2019-11-16 00:00:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:58,534 INFO L462 AbstractCegarLoop]: Abstraction has 65445 states and 239375 transitions. [2019-11-16 00:00:58,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:00:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 65445 states and 239375 transitions. [2019-11-16 00:00:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-16 00:00:58,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:58,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:00:58,603 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:58,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:58,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1556884819, now seen corresponding path program 1 times [2019-11-16 00:00:58,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:58,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986948280] [2019-11-16 00:00:58,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:58,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:58,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:58,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986948280] [2019-11-16 00:00:58,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:58,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:00:58,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378835429] [2019-11-16 00:00:58,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:00:58,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:00:58,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:00:58,691 INFO L87 Difference]: Start difference. First operand 65445 states and 239375 transitions. Second operand 4 states. [2019-11-16 00:00:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:58,794 INFO L93 Difference]: Finished difference Result 21246 states and 67090 transitions. [2019-11-16 00:00:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:00:58,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-16 00:00:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:58,831 INFO L225 Difference]: With dead ends: 21246 [2019-11-16 00:00:58,831 INFO L226 Difference]: Without dead ends: 20547 [2019-11-16 00:00:58,835 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-16 00:00:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20547 states. [2019-11-16 00:00:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20547 to 20439. [2019-11-16 00:00:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20439 states. [2019-11-16 00:00:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20439 states to 20439 states and 64584 transitions. [2019-11-16 00:00:59,086 INFO L78 Accepts]: Start accepts. Automaton has 20439 states and 64584 transitions. Word has length 67 [2019-11-16 00:00:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:59,086 INFO L462 AbstractCegarLoop]: Abstraction has 20439 states and 64584 transitions. [2019-11-16 00:00:59,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:00:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 20439 states and 64584 transitions. [2019-11-16 00:00:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:00:59,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:59,103 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] [2019-11-16 00:00:59,103 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1754303503, now seen corresponding path program 1 times [2019-11-16 00:00:59,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:59,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651761226] [2019-11-16 00:00:59,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:59,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:59,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:59,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651761226] [2019-11-16 00:00:59,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:59,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:00:59,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579191914] [2019-11-16 00:00:59,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:00:59,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:00:59,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:00:59,213 INFO L87 Difference]: Start difference. First operand 20439 states and 64584 transitions. Second operand 8 states. [2019-11-16 00:01:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:00,204 INFO L93 Difference]: Finished difference Result 22581 states and 70785 transitions. [2019-11-16 00:01:00,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:01:00,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-11-16 00:01:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:00,233 INFO L225 Difference]: With dead ends: 22581 [2019-11-16 00:01:00,234 INFO L226 Difference]: Without dead ends: 22533 [2019-11-16 00:01:00,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:01:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2019-11-16 00:01:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 17910. [2019-11-16 00:01:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17910 states. [2019-11-16 00:01:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 56952 transitions. [2019-11-16 00:01:00,476 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 56952 transitions. Word has length 77 [2019-11-16 00:01:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:00,476 INFO L462 AbstractCegarLoop]: Abstraction has 17910 states and 56952 transitions. [2019-11-16 00:01:00,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:01:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 56952 transitions. [2019-11-16 00:01:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:01:00,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:00,498 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] [2019-11-16 00:01:00,499 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1051778439, now seen corresponding path program 1 times [2019-11-16 00:01:00,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:00,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600354846] [2019-11-16 00:01:00,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:00,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:00,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:00,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600354846] [2019-11-16 00:01:00,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:00,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:00,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479614084] [2019-11-16 00:01:00,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:00,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:00,582 INFO L87 Difference]: Start difference. First operand 17910 states and 56952 transitions. Second operand 3 states. [2019-11-16 00:01:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:00,798 INFO L93 Difference]: Finished difference Result 19343 states and 61175 transitions. [2019-11-16 00:01:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:00,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-16 00:01:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:00,827 INFO L225 Difference]: With dead ends: 19343 [2019-11-16 00:01:00,828 INFO L226 Difference]: Without dead ends: 19343 [2019-11-16 00:01:00,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19343 states. [2019-11-16 00:01:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19343 to 18604. [2019-11-16 00:01:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18604 states. [2019-11-16 00:01:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18604 states to 18604 states and 59000 transitions. [2019-11-16 00:01:01,069 INFO L78 Accepts]: Start accepts. Automaton has 18604 states and 59000 transitions. Word has length 78 [2019-11-16 00:01:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:01,070 INFO L462 AbstractCegarLoop]: Abstraction has 18604 states and 59000 transitions. [2019-11-16 00:01:01,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18604 states and 59000 transitions. [2019-11-16 00:01:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:01:01,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:01,084 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] [2019-11-16 00:01:01,085 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1904019491, now seen corresponding path program 1 times [2019-11-16 00:01:01,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6975462] [2019-11-16 00:01:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:01,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6975462] [2019-11-16 00:01:01,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:01,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:01,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961342503] [2019-11-16 00:01:01,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:01,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:01,139 INFO L87 Difference]: Start difference. First operand 18604 states and 59000 transitions. Second operand 4 states. [2019-11-16 00:01:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:01,402 INFO L93 Difference]: Finished difference Result 22440 states and 70067 transitions. [2019-11-16 00:01:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:01:01,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-16 00:01:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:01,430 INFO L225 Difference]: With dead ends: 22440 [2019-11-16 00:01:01,430 INFO L226 Difference]: Without dead ends: 22332 [2019-11-16 00:01:01,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22332 states. [2019-11-16 00:01:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22332 to 21225. [2019-11-16 00:01:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21225 states. [2019-11-16 00:01:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21225 states to 21225 states and 66650 transitions. [2019-11-16 00:01:01,838 INFO L78 Accepts]: Start accepts. Automaton has 21225 states and 66650 transitions. Word has length 79 [2019-11-16 00:01:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:01,839 INFO L462 AbstractCegarLoop]: Abstraction has 21225 states and 66650 transitions. [2019-11-16 00:01:01,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21225 states and 66650 transitions. [2019-11-16 00:01:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:01:01,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:01,855 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:01,855 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash -31640796, now seen corresponding path program 1 times [2019-11-16 00:01:01,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721409553] [2019-11-16 00:01:01,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:01,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721409553] [2019-11-16 00:01:01,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:01,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:01,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840430881] [2019-11-16 00:01:01,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:01,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:01,896 INFO L87 Difference]: Start difference. First operand 21225 states and 66650 transitions. Second operand 3 states. [2019-11-16 00:01:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:02,193 INFO L93 Difference]: Finished difference Result 22696 states and 70972 transitions. [2019-11-16 00:01:02,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:02,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-16 00:01:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:02,232 INFO L225 Difference]: With dead ends: 22696 [2019-11-16 00:01:02,233 INFO L226 Difference]: Without dead ends: 22696 [2019-11-16 00:01:02,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22696 states. [2019-11-16 00:01:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22696 to 21953. [2019-11-16 00:01:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21953 states. [2019-11-16 00:01:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 68786 transitions. [2019-11-16 00:01:02,567 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 68786 transitions. Word has length 79 [2019-11-16 00:01:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:02,567 INFO L462 AbstractCegarLoop]: Abstraction has 21953 states and 68786 transitions. [2019-11-16 00:01:02,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 68786 transitions. [2019-11-16 00:01:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:01:02,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:02,586 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] [2019-11-16 00:01:02,586 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash -211181876, now seen corresponding path program 1 times [2019-11-16 00:01:02,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:02,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376695580] [2019-11-16 00:01:02,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:02,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:02,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376695580] [2019-11-16 00:01:02,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:02,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:02,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108039249] [2019-11-16 00:01:02,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:02,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:02,691 INFO L87 Difference]: Start difference. First operand 21953 states and 68786 transitions. Second operand 6 states. [2019-11-16 00:01:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:03,156 INFO L93 Difference]: Finished difference Result 23567 states and 73153 transitions. [2019-11-16 00:01:03,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:03,156 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-16 00:01:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:03,186 INFO L225 Difference]: With dead ends: 23567 [2019-11-16 00:01:03,186 INFO L226 Difference]: Without dead ends: 23567 [2019-11-16 00:01:03,186 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-16 00:01:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23567 states. [2019-11-16 00:01:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23567 to 22578. [2019-11-16 00:01:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22578 states. [2019-11-16 00:01:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22578 states to 22578 states and 70288 transitions. [2019-11-16 00:01:03,461 INFO L78 Accepts]: Start accepts. Automaton has 22578 states and 70288 transitions. Word has length 80 [2019-11-16 00:01:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:03,461 INFO L462 AbstractCegarLoop]: Abstraction has 22578 states and 70288 transitions. [2019-11-16 00:01:03,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22578 states and 70288 transitions. [2019-11-16 00:01:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:01:03,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:03,479 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] [2019-11-16 00:01:03,480 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2146842163, now seen corresponding path program 1 times [2019-11-16 00:01:03,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:03,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785603196] [2019-11-16 00:01:03,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:03,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:03,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:03,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-16 00:01:03,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785603196] [2019-11-16 00:01:03,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:03,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:03,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455913874] [2019-11-16 00:01:03,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:03,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:03,584 INFO L87 Difference]: Start difference. First operand 22578 states and 70288 transitions. Second operand 7 states. [2019-11-16 00:01:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:04,127 INFO L93 Difference]: Finished difference Result 24538 states and 75698 transitions. [2019-11-16 00:01:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:01:04,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-11-16 00:01:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:04,157 INFO L225 Difference]: With dead ends: 24538 [2019-11-16 00:01:04,157 INFO L226 Difference]: Without dead ends: 24538 [2019-11-16 00:01:04,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24538 states. [2019-11-16 00:01:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24538 to 23533. [2019-11-16 00:01:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23533 states. [2019-11-16 00:01:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23533 states to 23533 states and 72789 transitions. [2019-11-16 00:01:04,440 INFO L78 Accepts]: Start accepts. Automaton has 23533 states and 72789 transitions. Word has length 80 [2019-11-16 00:01:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:04,440 INFO L462 AbstractCegarLoop]: Abstraction has 23533 states and 72789 transitions. [2019-11-16 00:01:04,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:04,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23533 states and 72789 transitions. [2019-11-16 00:01:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:01:04,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:04,462 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] [2019-11-16 00:01:04,462 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:04,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1817076402, now seen corresponding path program 1 times [2019-11-16 00:01:04,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:04,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209929444] [2019-11-16 00:01:04,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:04,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:04,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:04,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209929444] [2019-11-16 00:01:04,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:04,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:04,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499759277] [2019-11-16 00:01:04,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:04,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:04,506 INFO L87 Difference]: Start difference. First operand 23533 states and 72789 transitions. Second operand 3 states. [2019-11-16 00:01:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:04,594 INFO L93 Difference]: Finished difference Result 21443 states and 65847 transitions. [2019-11-16 00:01:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:04,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-16 00:01:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:04,631 INFO L225 Difference]: With dead ends: 21443 [2019-11-16 00:01:04,632 INFO L226 Difference]: Without dead ends: 21443 [2019-11-16 00:01:04,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21443 states. [2019-11-16 00:01:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21443 to 20628. [2019-11-16 00:01:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20628 states. [2019-11-16 00:01:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20628 states to 20628 states and 63530 transitions. [2019-11-16 00:01:04,926 INFO L78 Accepts]: Start accepts. Automaton has 20628 states and 63530 transitions. Word has length 80 [2019-11-16 00:01:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:04,927 INFO L462 AbstractCegarLoop]: Abstraction has 20628 states and 63530 transitions. [2019-11-16 00:01:04,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20628 states and 63530 transitions. [2019-11-16 00:01:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:01:04,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:04,944 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] [2019-11-16 00:01:04,944 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1169856429, now seen corresponding path program 1 times [2019-11-16 00:01:04,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:04,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202569680] [2019-11-16 00:01:04,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:04,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:04,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:05,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202569680] [2019-11-16 00:01:05,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:05,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:05,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98016978] [2019-11-16 00:01:05,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:05,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:05,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:05,023 INFO L87 Difference]: Start difference. First operand 20628 states and 63530 transitions. Second operand 7 states. [2019-11-16 00:01:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:05,595 INFO L93 Difference]: Finished difference Result 38101 states and 117006 transitions. [2019-11-16 00:01:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:01:05,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-11-16 00:01:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:05,645 INFO L225 Difference]: With dead ends: 38101 [2019-11-16 00:01:05,645 INFO L226 Difference]: Without dead ends: 38101 [2019-11-16 00:01:05,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:01:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38101 states. [2019-11-16 00:01:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38101 to 23012. [2019-11-16 00:01:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23012 states. [2019-11-16 00:01:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23012 states to 23012 states and 70578 transitions. [2019-11-16 00:01:06,003 INFO L78 Accepts]: Start accepts. Automaton has 23012 states and 70578 transitions. Word has length 80 [2019-11-16 00:01:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:06,003 INFO L462 AbstractCegarLoop]: Abstraction has 23012 states and 70578 transitions. [2019-11-16 00:01:06,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23012 states and 70578 transitions. [2019-11-16 00:01:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:01:06,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:06,023 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] [2019-11-16 00:01:06,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1399629970, now seen corresponding path program 1 times [2019-11-16 00:01:06,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:06,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002065043] [2019-11-16 00:01:06,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:06,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002065043] [2019-11-16 00:01:06,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:06,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:06,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109900530] [2019-11-16 00:01:06,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:06,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:06,075 INFO L87 Difference]: Start difference. First operand 23012 states and 70578 transitions. Second operand 3 states. [2019-11-16 00:01:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:06,207 INFO L93 Difference]: Finished difference Result 21443 states and 65056 transitions. [2019-11-16 00:01:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:06,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-16 00:01:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:06,242 INFO L225 Difference]: With dead ends: 21443 [2019-11-16 00:01:06,243 INFO L226 Difference]: Without dead ends: 21329 [2019-11-16 00:01:06,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21329 states. [2019-11-16 00:01:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21329 to 20339. [2019-11-16 00:01:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20339 states. [2019-11-16 00:01:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20339 states to 20339 states and 61940 transitions. [2019-11-16 00:01:06,793 INFO L78 Accepts]: Start accepts. Automaton has 20339 states and 61940 transitions. Word has length 80 [2019-11-16 00:01:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:06,793 INFO L462 AbstractCegarLoop]: Abstraction has 20339 states and 61940 transitions. [2019-11-16 00:01:06,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20339 states and 61940 transitions. [2019-11-16 00:01:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:01:06,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:06,816 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] [2019-11-16 00:01:06,816 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1290499927, now seen corresponding path program 1 times [2019-11-16 00:01:06,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:06,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665484550] [2019-11-16 00:01:06,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:06,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:06,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665484550] [2019-11-16 00:01:06,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:06,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:01:06,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593125903] [2019-11-16 00:01:06,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:01:06,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:01:06,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:01:06,927 INFO L87 Difference]: Start difference. First operand 20339 states and 61940 transitions. Second operand 8 states. [2019-11-16 00:01:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:08,594 INFO L93 Difference]: Finished difference Result 46556 states and 136736 transitions. [2019-11-16 00:01:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-16 00:01:08,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-11-16 00:01:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:08,646 INFO L225 Difference]: With dead ends: 46556 [2019-11-16 00:01:08,646 INFO L226 Difference]: Without dead ends: 46055 [2019-11-16 00:01:08,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-11-16 00:01:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2019-11-16 00:01:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 22861. [2019-11-16 00:01:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22861 states. [2019-11-16 00:01:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 68948 transitions. [2019-11-16 00:01:09,020 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 68948 transitions. Word has length 81 [2019-11-16 00:01:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:09,020 INFO L462 AbstractCegarLoop]: Abstraction has 22861 states and 68948 transitions. [2019-11-16 00:01:09,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:01:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 68948 transitions. [2019-11-16 00:01:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:01:09,036 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:09,037 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] [2019-11-16 00:01:09,037 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash 915878571, now seen corresponding path program 1 times [2019-11-16 00:01:09,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:09,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067145028] [2019-11-16 00:01:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:09,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:09,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:09,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067145028] [2019-11-16 00:01:09,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:09,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:09,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225499422] [2019-11-16 00:01:09,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:09,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:09,141 INFO L87 Difference]: Start difference. First operand 22861 states and 68948 transitions. Second operand 6 states. [2019-11-16 00:01:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:09,597 INFO L93 Difference]: Finished difference Result 24094 states and 72234 transitions. [2019-11-16 00:01:09,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:01:09,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-16 00:01:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:09,641 INFO L225 Difference]: With dead ends: 24094 [2019-11-16 00:01:09,641 INFO L226 Difference]: Without dead ends: 24094 [2019-11-16 00:01:09,642 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-16 00:01:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24094 states. [2019-11-16 00:01:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24094 to 23156. [2019-11-16 00:01:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23156 states. [2019-11-16 00:01:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23156 states to 23156 states and 69558 transitions. [2019-11-16 00:01:10,001 INFO L78 Accepts]: Start accepts. Automaton has 23156 states and 69558 transitions. Word has length 81 [2019-11-16 00:01:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:10,002 INFO L462 AbstractCegarLoop]: Abstraction has 23156 states and 69558 transitions. [2019-11-16 00:01:10,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23156 states and 69558 transitions. [2019-11-16 00:01:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:01:10,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:10,026 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] [2019-11-16 00:01:10,026 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1019781716, now seen corresponding path program 1 times [2019-11-16 00:01:10,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:10,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297815199] [2019-11-16 00:01:10,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:10,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297815199] [2019-11-16 00:01:10,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:10,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:01:10,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032444092] [2019-11-16 00:01:10,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:01:10,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:01:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:10,113 INFO L87 Difference]: Start difference. First operand 23156 states and 69558 transitions. Second operand 6 states. [2019-11-16 00:01:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:10,564 INFO L93 Difference]: Finished difference Result 25463 states and 74922 transitions. [2019-11-16 00:01:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:01:10,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-16 00:01:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:10,607 INFO L225 Difference]: With dead ends: 25463 [2019-11-16 00:01:10,607 INFO L226 Difference]: Without dead ends: 25463 [2019-11-16 00:01:10,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:01:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25463 states. [2019-11-16 00:01:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25463 to 22791. [2019-11-16 00:01:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22791 states. [2019-11-16 00:01:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22791 states to 22791 states and 67463 transitions. [2019-11-16 00:01:10,933 INFO L78 Accepts]: Start accepts. Automaton has 22791 states and 67463 transitions. Word has length 81 [2019-11-16 00:01:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:10,933 INFO L462 AbstractCegarLoop]: Abstraction has 22791 states and 67463 transitions. [2019-11-16 00:01:10,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:01:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 22791 states and 67463 transitions. [2019-11-16 00:01:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:01:10,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:10,949 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:10,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1398572843, now seen corresponding path program 1 times [2019-11-16 00:01:10,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:10,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277124831] [2019-11-16 00:01:10,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:10,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:11,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277124831] [2019-11-16 00:01:11,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:11,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:11,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494864253] [2019-11-16 00:01:11,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:11,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:11,037 INFO L87 Difference]: Start difference. First operand 22791 states and 67463 transitions. Second operand 5 states. [2019-11-16 00:01:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:11,398 INFO L93 Difference]: Finished difference Result 33090 states and 97828 transitions. [2019-11-16 00:01:11,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:11,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:01:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:11,441 INFO L225 Difference]: With dead ends: 33090 [2019-11-16 00:01:11,442 INFO L226 Difference]: Without dead ends: 32880 [2019-11-16 00:01:11,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32880 states. [2019-11-16 00:01:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32880 to 28929. [2019-11-16 00:01:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28929 states. [2019-11-16 00:01:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28929 states to 28929 states and 86039 transitions. [2019-11-16 00:01:11,812 INFO L78 Accepts]: Start accepts. Automaton has 28929 states and 86039 transitions. Word has length 81 [2019-11-16 00:01:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:11,813 INFO L462 AbstractCegarLoop]: Abstraction has 28929 states and 86039 transitions. [2019-11-16 00:01:11,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 28929 states and 86039 transitions. [2019-11-16 00:01:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:01:11,835 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:11,836 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1651629972, now seen corresponding path program 1 times [2019-11-16 00:01:11,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:11,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905087804] [2019-11-16 00:01:11,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:11,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:11,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:11,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905087804] [2019-11-16 00:01:11,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:11,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:11,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026214549] [2019-11-16 00:01:11,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:11,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:11,903 INFO L87 Difference]: Start difference. First operand 28929 states and 86039 transitions. Second operand 5 states. [2019-11-16 00:01:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:11,942 INFO L93 Difference]: Finished difference Result 3837 states and 9221 transitions. [2019-11-16 00:01:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:01:11,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-16 00:01:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:11,947 INFO L225 Difference]: With dead ends: 3837 [2019-11-16 00:01:11,947 INFO L226 Difference]: Without dead ends: 3284 [2019-11-16 00:01:11,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2019-11-16 00:01:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3051. [2019-11-16 00:01:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3051 states. [2019-11-16 00:01:11,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 7357 transitions. [2019-11-16 00:01:11,976 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 7357 transitions. Word has length 81 [2019-11-16 00:01:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:11,976 INFO L462 AbstractCegarLoop]: Abstraction has 3051 states and 7357 transitions. [2019-11-16 00:01:11,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 7357 transitions. [2019-11-16 00:01:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:11,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:11,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:11,979 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 337244310, now seen corresponding path program 1 times [2019-11-16 00:01:11,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:11,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554182434] [2019-11-16 00:01:11,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:11,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:11,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:12,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554182434] [2019-11-16 00:01:12,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:12,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:12,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992848792] [2019-11-16 00:01:12,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:12,078 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:12,079 INFO L87 Difference]: Start difference. First operand 3051 states and 7357 transitions. Second operand 7 states. [2019-11-16 00:01:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:12,418 INFO L93 Difference]: Finished difference Result 4023 states and 9525 transitions. [2019-11-16 00:01:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:01:12,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:01:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:12,421 INFO L225 Difference]: With dead ends: 4023 [2019-11-16 00:01:12,421 INFO L226 Difference]: Without dead ends: 3987 [2019-11-16 00:01:12,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:01:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2019-11-16 00:01:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3456. [2019-11-16 00:01:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-11-16 00:01:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 8247 transitions. [2019-11-16 00:01:12,454 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 8247 transitions. Word has length 94 [2019-11-16 00:01:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:12,455 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 8247 transitions. [2019-11-16 00:01:12,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 8247 transitions. [2019-11-16 00:01:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:12,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:12,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:12,458 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 54093846, now seen corresponding path program 1 times [2019-11-16 00:01:12,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:12,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101149960] [2019-11-16 00:01:12,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:12,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:12,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:12,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-16 00:01:12,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101149960] [2019-11-16 00:01:12,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:12,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:01:12,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488001150] [2019-11-16 00:01:12,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:01:12,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:01:12,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:12,571 INFO L87 Difference]: Start difference. First operand 3456 states and 8247 transitions. Second operand 7 states. [2019-11-16 00:01:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:12,994 INFO L93 Difference]: Finished difference Result 4421 states and 10501 transitions. [2019-11-16 00:01:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:01:12,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-11-16 00:01:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:12,997 INFO L225 Difference]: With dead ends: 4421 [2019-11-16 00:01:12,997 INFO L226 Difference]: Without dead ends: 4393 [2019-11-16 00:01:12,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:01:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2019-11-16 00:01:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3377. [2019-11-16 00:01:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-11-16 00:01:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 8054 transitions. [2019-11-16 00:01:13,036 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 8054 transitions. Word has length 94 [2019-11-16 00:01:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:13,036 INFO L462 AbstractCegarLoop]: Abstraction has 3377 states and 8054 transitions. [2019-11-16 00:01:13,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:01:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 8054 transitions. [2019-11-16 00:01:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:13,041 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:13,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:13,041 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1598415977, now seen corresponding path program 1 times [2019-11-16 00:01:13,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:13,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702826594] [2019-11-16 00:01:13,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:13,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702826594] [2019-11-16 00:01:13,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:13,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:13,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750761324] [2019-11-16 00:01:13,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:13,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:13,107 INFO L87 Difference]: Start difference. First operand 3377 states and 8054 transitions. Second operand 4 states. [2019-11-16 00:01:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:13,346 INFO L93 Difference]: Finished difference Result 3692 states and 8771 transitions. [2019-11-16 00:01:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:13,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:01:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:13,351 INFO L225 Difference]: With dead ends: 3692 [2019-11-16 00:01:13,351 INFO L226 Difference]: Without dead ends: 3656 [2019-11-16 00:01:13,352 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-16 00:01:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2019-11-16 00:01:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3245. [2019-11-16 00:01:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3245 states. [2019-11-16 00:01:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 7746 transitions. [2019-11-16 00:01:13,406 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 7746 transitions. Word has length 94 [2019-11-16 00:01:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:13,406 INFO L462 AbstractCegarLoop]: Abstraction has 3245 states and 7746 transitions. [2019-11-16 00:01:13,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 7746 transitions. [2019-11-16 00:01:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:13,411 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:13,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:13,412 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1881566441, now seen corresponding path program 1 times [2019-11-16 00:01:13,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:13,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583620939] [2019-11-16 00:01:13,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:13,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583620939] [2019-11-16 00:01:13,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:13,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:13,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392915229] [2019-11-16 00:01:13,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:13,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:13,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:13,498 INFO L87 Difference]: Start difference. First operand 3245 states and 7746 transitions. Second operand 5 states. [2019-11-16 00:01:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:13,701 INFO L93 Difference]: Finished difference Result 3020 states and 7041 transitions. [2019-11-16 00:01:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:01:13,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:01:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:13,705 INFO L225 Difference]: With dead ends: 3020 [2019-11-16 00:01:13,706 INFO L226 Difference]: Without dead ends: 3002 [2019-11-16 00:01:13,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:01:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2019-11-16 00:01:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2204. [2019-11-16 00:01:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2204 states. [2019-11-16 00:01:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 5195 transitions. [2019-11-16 00:01:13,747 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 5195 transitions. Word has length 94 [2019-11-16 00:01:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:13,747 INFO L462 AbstractCegarLoop]: Abstraction has 2204 states and 5195 transitions. [2019-11-16 00:01:13,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:01:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 5195 transitions. [2019-11-16 00:01:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:13,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:13,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:13,751 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash -636801960, now seen corresponding path program 1 times [2019-11-16 00:01:13,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:13,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358596374] [2019-11-16 00:01:13,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:13,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:13,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358596374] [2019-11-16 00:01:13,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:13,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:01:13,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590242561] [2019-11-16 00:01:13,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:01:13,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:01:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:01:13,928 INFO L87 Difference]: Start difference. First operand 2204 states and 5195 transitions. Second operand 11 states. [2019-11-16 00:01:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:14,218 INFO L93 Difference]: Finished difference Result 3438 states and 8218 transitions. [2019-11-16 00:01:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:01:14,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-11-16 00:01:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:14,223 INFO L225 Difference]: With dead ends: 3438 [2019-11-16 00:01:14,223 INFO L226 Difference]: Without dead ends: 2799 [2019-11-16 00:01:14,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:01:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-11-16 00:01:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2665. [2019-11-16 00:01:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-11-16 00:01:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 6228 transitions. [2019-11-16 00:01:14,266 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 6228 transitions. Word has length 94 [2019-11-16 00:01:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:14,267 INFO L462 AbstractCegarLoop]: Abstraction has 2665 states and 6228 transitions. [2019-11-16 00:01:14,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:01:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 6228 transitions. [2019-11-16 00:01:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:14,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:14,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:14,271 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash -848992711, now seen corresponding path program 1 times [2019-11-16 00:01:14,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:14,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430702632] [2019-11-16 00:01:14,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:01:14,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430702632] [2019-11-16 00:01:14,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:14,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:01:14,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421340270] [2019-11-16 00:01:14,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:01:14,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:14,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:01:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:01:14,339 INFO L87 Difference]: Start difference. First operand 2665 states and 6228 transitions. Second operand 4 states. [2019-11-16 00:01:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:14,378 INFO L93 Difference]: Finished difference Result 2714 states and 6287 transitions. [2019-11-16 00:01:14,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:01:14,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:01:14,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:14,382 INFO L225 Difference]: With dead ends: 2714 [2019-11-16 00:01:14,382 INFO L226 Difference]: Without dead ends: 2714 [2019-11-16 00:01:14,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-11-16 00:01:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2653. [2019-11-16 00:01:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2653 states. [2019-11-16 00:01:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 6131 transitions. [2019-11-16 00:01:14,421 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 6131 transitions. Word has length 94 [2019-11-16 00:01:14,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:14,422 INFO L462 AbstractCegarLoop]: Abstraction has 2653 states and 6131 transitions. [2019-11-16 00:01:14,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:01:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 6131 transitions. [2019-11-16 00:01:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:01:14,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:14,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:01:14,425 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:14,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:14,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1087514946, now seen corresponding path program 2 times [2019-11-16 00:01:14,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:14,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9136467] [2019-11-16 00:01:14,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:14,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:01:14,523 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:01:14,523 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:01:14,675 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:01:14,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:01:14 BasicIcfg [2019-11-16 00:01:14,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:01:14,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:01:14,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:01:14,689 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:01:14,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:00:35" (3/4) ... [2019-11-16 00:01:14,692 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:01:14,817 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a2c56dbb-f30f-462b-a257-ef1b982d5d79/bin/uautomizer/witness.graphml [2019-11-16 00:01:14,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:01:14,819 INFO L168 Benchmark]: Toolchain (without parser) took 40842.42 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -367.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,820 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:01:14,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,821 INFO L168 Benchmark]: Boogie Preprocessor took 53.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:01:14,821 INFO L168 Benchmark]: RCFGBuilder took 766.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,821 INFO L168 Benchmark]: TraceAbstraction took 39091.14 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,822 INFO L168 Benchmark]: Witness Printer took 128.61 ms. Allocated memory is still 4.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:01:14,825 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.17 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 766.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39091.14 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -273.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 128.61 ms. Allocated memory is still 4.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 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] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L702] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L703] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L704] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L705] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L706] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L707] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L708] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L709] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L710] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L711] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L712] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L713] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L714] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 2 x$w_buff1 = x$w_buff0 [L743] 2 x$w_buff0 = 2 [L744] 2 x$w_buff1_used = x$w_buff0_used [L745] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L732] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x = x$flush_delayed ? x$mem_tmp : x [L807] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 175 locations, 3 error locations. Result: UNSAFE, OverallTime: 38.9s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8421 SDtfs, 9396 SDslu, 20052 SDs, 0 SdLazy, 9645 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 93 SyntacticMatches, 11 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65445occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 160589 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2329 NumberOfCodeBlocks, 2329 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2205 ConstructedInterpolants, 0 QuantifiedInterpolants, 401445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...