./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 08bc1f8a13d0042f6e36f207172f32d81bf0e164 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2018-12-31 21:12:39,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 21:12:39,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 21:12:39,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 21:12:39,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 21:12:39,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 21:12:39,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 21:12:39,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 21:12:39,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 21:12:39,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 21:12:39,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 21:12:39,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 21:12:39,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 21:12:39,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 21:12:39,770 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 21:12:39,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 21:12:39,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 21:12:39,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 21:12:39,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 21:12:39,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 21:12:39,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 21:12:39,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 21:12:39,797 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 21:12:39,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 21:12:39,798 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 21:12:39,799 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 21:12:39,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 21:12:39,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 21:12:39,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 21:12:39,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 21:12:39,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 21:12:39,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 21:12:39,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 21:12:39,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 21:12:39,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 21:12:39,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 21:12:39,815 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 21:12:39,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 21:12:39,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 21:12:39,845 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 21:12:39,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 21:12:39,848 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 21:12:39,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 21:12:39,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 21:12:39,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 21:12:39,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 21:12:39,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 21:12:39,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 21:12:39,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 21:12:39,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 21:12:39,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 21:12:39,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 21:12:39,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 21:12:39,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 21:12:39,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 21:12:39,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 08bc1f8a13d0042f6e36f207172f32d81bf0e164 [2018-12-31 21:12:39,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 21:12:39,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 21:12:39,924 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 21:12:39,926 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 21:12:39,926 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 21:12:39,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i [2018-12-31 21:12:39,991 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934876c01/598e22bfb1d34bdd8c3cb09a036870ca/FLAGb795a6eed [2018-12-31 21:12:40,538 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 21:12:40,539 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix041_pso.oepc_false-unreach-call.i [2018-12-31 21:12:40,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934876c01/598e22bfb1d34bdd8c3cb09a036870ca/FLAGb795a6eed [2018-12-31 21:12:40,810 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934876c01/598e22bfb1d34bdd8c3cb09a036870ca [2018-12-31 21:12:40,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 21:12:40,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 21:12:40,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 21:12:40,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 21:12:40,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 21:12:40,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:12:40" (1/1) ... [2018-12-31 21:12:40,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a4753f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:40, skipping insertion in model container [2018-12-31 21:12:40,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:12:40" (1/1) ... [2018-12-31 21:12:40,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 21:12:40,900 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 21:12:41,508 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:12:41,529 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 21:12:41,718 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 21:12:41,810 INFO L195 MainTranslator]: Completed translation [2018-12-31 21:12:41,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41 WrapperNode [2018-12-31 21:12:41,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 21:12:41,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 21:12:41,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 21:12:41,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 21:12:41,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 21:12:41,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 21:12:41,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 21:12:41,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 21:12:41,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... [2018-12-31 21:12:41,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 21:12:41,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 21:12:41,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 21:12:41,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 21:12:41,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-12-31 21:12:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 21:12:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 21:12:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 21:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 21:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 21:12:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 21:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 21:12:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 21:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 21:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 21:12:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 21:12:42,021 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 21:12:43,130 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 21:12:43,130 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 21:12:43,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:43 BoogieIcfgContainer [2018-12-31 21:12:43,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 21:12:43,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 21:12:43,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 21:12:43,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 21:12:43,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:12:40" (1/3) ... [2018-12-31 21:12:43,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:12:43, skipping insertion in model container [2018-12-31 21:12:43,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:12:41" (2/3) ... [2018-12-31 21:12:43,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e29555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:12:43, skipping insertion in model container [2018-12-31 21:12:43,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:43" (3/3) ... [2018-12-31 21:12:43,149 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc_false-unreach-call.i [2018-12-31 21:12:43,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,203 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,203 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,203 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,203 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,204 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,204 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,204 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,205 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,206 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,208 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,209 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,210 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,211 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,213 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,214 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,215 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,229 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,230 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,231 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,232 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,233 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,234 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,235 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,236 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,237 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,238 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,239 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 21:12:43,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 21:12:43,270 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 21:12:43,280 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 21:12:43,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 21:12:43,328 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 21:12:43,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 21:12:43,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 21:12:43,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 21:12:43,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 21:12:43,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 21:12:43,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 21:12:43,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 21:12:43,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 21:12:43,349 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 21:12:45,946 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 21:12:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 21:12:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 21:12:45,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:45,958 INFO L402 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] [2018-12-31 21:12:45,960 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-31 21:12:45,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:45,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:46,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:46,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:12:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:12:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:12:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:46,384 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 21:12:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:47,891 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 21:12:47,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:12:47,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 21:12:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:48,250 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 21:12:48,251 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 21:12:48,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:12:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 21:12:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 21:12:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 21:12:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 21:12:50,101 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 21:12:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:50,103 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 21:12:50,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:12:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 21:12:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 21:12:50,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:50,122 INFO L402 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] [2018-12-31 21:12:50,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-31 21:12:50,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:50,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:50,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:50,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:50,471 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-31 21:12:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:53,910 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-31 21:12:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:53,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 21:12:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:54,889 INFO L225 Difference]: With dead ends: 64005 [2018-12-31 21:12:54,890 INFO L226 Difference]: Without dead ends: 63453 [2018-12-31 21:12:54,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-31 21:12:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-31 21:12:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-31 21:12:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-31 21:12:56,332 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-31 21:12:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:12:56,334 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-31 21:12:56,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:12:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-31 21:12:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 21:12:56,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:12:56,343 INFO L402 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] [2018-12-31 21:12:56,343 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:12:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:12:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-31 21:12:56,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:12:56,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:12:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:12:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:12:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:12:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:12:56,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:12:56,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:12:56,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:12:56,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:12:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:12:56,598 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-31 21:12:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:12:58,164 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-31 21:12:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:12:58,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 21:12:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:12:58,421 INFO L225 Difference]: With dead ends: 81367 [2018-12-31 21:12:58,422 INFO L226 Difference]: Without dead ends: 80855 [2018-12-31 21:12:58,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:12:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-31 21:13:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-31 21:13:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-31 21:13:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-31 21:13:00,601 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-31 21:13:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:00,602 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-31 21:13:00,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-31 21:13:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 21:13:00,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:00,613 INFO L402 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] [2018-12-31 21:13:00,613 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:00,614 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-31 21:13:00,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:00,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:00,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:00,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:00,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:00,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:00,689 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-31 21:13:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:01,020 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-31 21:13:01,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:01,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 21:13:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:01,184 INFO L225 Difference]: With dead ends: 65251 [2018-12-31 21:13:01,184 INFO L226 Difference]: Without dead ends: 65251 [2018-12-31 21:13:01,184 INFO L631 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 [2018-12-31 21:13:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-31 21:13:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-31 21:13:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-31 21:13:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-31 21:13:02,407 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-31 21:13:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:02,407 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-31 21:13:02,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-31 21:13:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:13:02,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:02,428 INFO L402 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] [2018-12-31 21:13:02,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-31 21:13:02,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:02,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:02,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:02,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:02,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:02,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:02,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:02,769 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-31 21:13:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:04,599 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-31 21:13:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:13:04,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 21:13:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:04,753 INFO L225 Difference]: With dead ends: 67511 [2018-12-31 21:13:04,754 INFO L226 Difference]: Without dead ends: 67511 [2018-12-31 21:13:04,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-31 21:13:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-31 21:13:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-31 21:13:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-31 21:13:06,075 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-31 21:13:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:06,076 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-31 21:13:06,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-31 21:13:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:13:06,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:06,095 INFO L402 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] [2018-12-31 21:13:06,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-31 21:13:06,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:06,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:06,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:06,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:06,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:06,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:06,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:13:06,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:13:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:13:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:06,273 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-31 21:13:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:08,578 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-31 21:13:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 21:13:08,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 21:13:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:08,773 INFO L225 Difference]: With dead ends: 88528 [2018-12-31 21:13:08,773 INFO L226 Difference]: Without dead ends: 88528 [2018-12-31 21:13:08,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:13:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-31 21:13:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-31 21:13:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-31 21:13:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-31 21:13:10,266 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-31 21:13:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:10,266 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-31 21:13:10,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:13:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-31 21:13:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:13:10,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:10,283 INFO L402 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] [2018-12-31 21:13:10,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-31 21:13:10,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:10,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:10,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:10,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:10,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:10,448 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2018-12-31 21:13:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:10,600 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-31 21:13:10,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:13:10,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-31 21:13:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:10,627 INFO L225 Difference]: With dead ends: 15375 [2018-12-31 21:13:10,627 INFO L226 Difference]: Without dead ends: 13789 [2018-12-31 21:13:10,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-31 21:13:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-31 21:13:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-31 21:13:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-31 21:13:10,856 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-31 21:13:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-31 21:13:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-31 21:13:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 21:13:10,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:10,859 INFO L402 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] [2018-12-31 21:13:10,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:10,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:10,860 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-31 21:13:10,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:10,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:10,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:10,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:11,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:11,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:11,246 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-31 21:13:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:12,048 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-31 21:13:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:13:12,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 21:13:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:12,087 INFO L225 Difference]: With dead ends: 19970 [2018-12-31 21:13:12,087 INFO L226 Difference]: Without dead ends: 19898 [2018-12-31 21:13:12,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 21:13:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-31 21:13:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-31 21:13:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-31 21:13:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-31 21:13:12,355 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-31 21:13:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:12,355 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-31 21:13:12,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-31 21:13:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 21:13:12,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:12,360 INFO L402 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] [2018-12-31 21:13:12,360 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-31 21:13:12,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:12,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:12,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:12,550 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-31 21:13:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:12,801 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-31 21:13:12,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:13:12,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 21:13:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:12,835 INFO L225 Difference]: With dead ends: 16617 [2018-12-31 21:13:12,835 INFO L226 Difference]: Without dead ends: 16617 [2018-12-31 21:13:12,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-31 21:13:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-31 21:13:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-31 21:13:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-31 21:13:13,159 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-31 21:13:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:13,160 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-31 21:13:13,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-31 21:13:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 21:13:13,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:13,165 INFO L402 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] [2018-12-31 21:13:13,165 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-31 21:13:13,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:13,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:13,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:13,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:13,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:13,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:13,389 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-31 21:13:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:14,077 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-31 21:13:14,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 21:13:14,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 21:13:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:14,127 INFO L225 Difference]: With dead ends: 28106 [2018-12-31 21:13:14,128 INFO L226 Difference]: Without dead ends: 28035 [2018-12-31 21:13:14,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:13:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-31 21:13:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-31 21:13:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-31 21:13:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-31 21:13:14,456 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-31 21:13:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:14,457 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-31 21:13:14,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-31 21:13:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 21:13:14,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:14,464 INFO L402 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] [2018-12-31 21:13:14,464 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash 527633642, now seen corresponding path program 1 times [2018-12-31 21:13:14,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:14,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:14,611 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-31 21:13:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:15,202 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-31 21:13:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:15,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-31 21:13:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:15,232 INFO L225 Difference]: With dead ends: 18092 [2018-12-31 21:13:15,233 INFO L226 Difference]: Without dead ends: 18092 [2018-12-31 21:13:15,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-31 21:13:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-31 21:13:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-31 21:13:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-31 21:13:15,495 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-31 21:13:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:15,495 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-31 21:13:15,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-31 21:13:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-31 21:13:15,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:15,502 INFO L402 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] [2018-12-31 21:13:15,503 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1690124311, now seen corresponding path program 1 times [2018-12-31 21:13:15,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:15,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:15,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:15,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:15,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:15,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:15,644 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-31 21:13:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:16,039 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-31 21:13:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:13:16,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-31 21:13:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:16,078 INFO L225 Difference]: With dead ends: 21696 [2018-12-31 21:13:16,078 INFO L226 Difference]: Without dead ends: 21696 [2018-12-31 21:13:16,079 INFO L631 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 [2018-12-31 21:13:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-31 21:13:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-31 21:13:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-31 21:13:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-31 21:13:16,382 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-31 21:13:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:16,382 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-31 21:13:16,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-31 21:13:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:16,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:16,393 INFO L402 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] [2018-12-31 21:13:16,393 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1735068466, now seen corresponding path program 1 times [2018-12-31 21:13:16,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:16,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:16,697 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-31 21:13:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:18,032 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-31 21:13:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:18,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:13:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:18,071 INFO L225 Difference]: With dead ends: 23814 [2018-12-31 21:13:18,071 INFO L226 Difference]: Without dead ends: 23814 [2018-12-31 21:13:18,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-31 21:13:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-31 21:13:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-31 21:13:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-31 21:13:18,409 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-31 21:13:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:18,409 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-31 21:13:18,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-31 21:13:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:18,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:18,422 INFO L402 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] [2018-12-31 21:13:18,422 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -342140877, now seen corresponding path program 1 times [2018-12-31 21:13:18,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:18,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:18,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:18,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:18,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:18,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:18,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:18,607 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-31 21:13:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:19,210 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-31 21:13:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:13:19,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 21:13:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:19,269 INFO L225 Difference]: With dead ends: 25702 [2018-12-31 21:13:19,269 INFO L226 Difference]: Without dead ends: 25702 [2018-12-31 21:13:19,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:13:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-31 21:13:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-31 21:13:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-31 21:13:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-31 21:13:19,885 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-31 21:13:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:19,886 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-31 21:13:19,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-31 21:13:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:19,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:19,898 INFO L402 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] [2018-12-31 21:13:19,898 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -130789964, now seen corresponding path program 1 times [2018-12-31 21:13:19,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:19,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:19,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:19,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:20,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:20,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:20,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:20,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:20,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:20,058 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-31 21:13:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:20,558 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-31 21:13:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:20,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:13:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:20,621 INFO L225 Difference]: With dead ends: 29793 [2018-12-31 21:13:20,621 INFO L226 Difference]: Without dead ends: 29793 [2018-12-31 21:13:20,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:20,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-31 21:13:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-31 21:13:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-31 21:13:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-31 21:13:21,004 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-31 21:13:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:21,005 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-31 21:13:21,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-31 21:13:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:21,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:21,020 INFO L402 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] [2018-12-31 21:13:21,020 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash -641324141, now seen corresponding path program 1 times [2018-12-31 21:13:21,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:21,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:21,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:21,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:21,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:21,427 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-31 21:13:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:22,272 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-31 21:13:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:13:22,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:13:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:22,340 INFO L225 Difference]: With dead ends: 36420 [2018-12-31 21:13:22,340 INFO L226 Difference]: Without dead ends: 36420 [2018-12-31 21:13:22,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-31 21:13:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-31 21:13:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-31 21:13:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-31 21:13:22,788 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-31 21:13:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:22,789 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-31 21:13:22,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-31 21:13:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:22,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:22,801 INFO L402 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] [2018-12-31 21:13:22,801 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:22,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1846188692, now seen corresponding path program 1 times [2018-12-31 21:13:22,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:22,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:22,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:22,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:22,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:23,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:23,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:23,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:23,059 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 5 states. [2018-12-31 21:13:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:23,199 INFO L93 Difference]: Finished difference Result 9076 states and 21915 transitions. [2018-12-31 21:13:23,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:13:23,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 21:13:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:23,211 INFO L225 Difference]: With dead ends: 9076 [2018-12-31 21:13:23,211 INFO L226 Difference]: Without dead ends: 7224 [2018-12-31 21:13:23,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-12-31 21:13:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6121. [2018-12-31 21:13:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-31 21:13:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14386 transitions. [2018-12-31 21:13:23,288 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14386 transitions. Word has length 67 [2018-12-31 21:13:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:23,288 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14386 transitions. [2018-12-31 21:13:23,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14386 transitions. [2018-12-31 21:13:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 21:13:23,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:23,294 INFO L402 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] [2018-12-31 21:13:23,295 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-31 21:13:23,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:23,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:23,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:23,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:23,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:23,379 INFO L87 Difference]: Start difference. First operand 6121 states and 14386 transitions. Second operand 3 states. [2018-12-31 21:13:23,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:23,442 INFO L93 Difference]: Finished difference Result 8340 states and 19493 transitions. [2018-12-31 21:13:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:23,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 21:13:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:23,452 INFO L225 Difference]: With dead ends: 8340 [2018-12-31 21:13:23,452 INFO L226 Difference]: Without dead ends: 8340 [2018-12-31 21:13:23,452 INFO L631 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 [2018-12-31 21:13:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2018-12-31 21:13:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 6060. [2018-12-31 21:13:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6060 states. [2018-12-31 21:13:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 13926 transitions. [2018-12-31 21:13:23,520 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 13926 transitions. Word has length 67 [2018-12-31 21:13:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:23,521 INFO L480 AbstractCegarLoop]: Abstraction has 6060 states and 13926 transitions. [2018-12-31 21:13:23,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 13926 transitions. [2018-12-31 21:13:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 21:13:23,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:23,527 INFO L402 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] [2018-12-31 21:13:23,527 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-31 21:13:23,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:23,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:23,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:23,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:23,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:23,613 INFO L87 Difference]: Start difference. First operand 6060 states and 13926 transitions. Second operand 5 states. [2018-12-31 21:13:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:23,823 INFO L93 Difference]: Finished difference Result 7230 states and 16567 transitions. [2018-12-31 21:13:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:13:23,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 21:13:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:23,833 INFO L225 Difference]: With dead ends: 7230 [2018-12-31 21:13:23,833 INFO L226 Difference]: Without dead ends: 7230 [2018-12-31 21:13:23,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:13:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2018-12-31 21:13:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 6504. [2018-12-31 21:13:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2018-12-31 21:13:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 14930 transitions. [2018-12-31 21:13:23,901 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 14930 transitions. Word has length 73 [2018-12-31 21:13:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:23,901 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 14930 transitions. [2018-12-31 21:13:23,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 14930 transitions. [2018-12-31 21:13:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 21:13:23,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:23,907 INFO L402 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] [2018-12-31 21:13:23,908 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-31 21:13:23,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:23,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:24,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:24,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:13:24,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:13:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:13:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:24,102 INFO L87 Difference]: Start difference. First operand 6504 states and 14930 transitions. Second operand 7 states. [2018-12-31 21:13:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:25,271 INFO L93 Difference]: Finished difference Result 7577 states and 17192 transitions. [2018-12-31 21:13:25,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 21:13:25,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 21:13:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:25,285 INFO L225 Difference]: With dead ends: 7577 [2018-12-31 21:13:25,285 INFO L226 Difference]: Without dead ends: 7458 [2018-12-31 21:13:25,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 21:13:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2018-12-31 21:13:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6601. [2018-12-31 21:13:25,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-31 21:13:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 15023 transitions. [2018-12-31 21:13:25,399 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 15023 transitions. Word has length 73 [2018-12-31 21:13:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:25,399 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 15023 transitions. [2018-12-31 21:13:25,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:13:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 15023 transitions. [2018-12-31 21:13:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:13:25,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:25,412 INFO L402 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] [2018-12-31 21:13:25,412 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1914844155, now seen corresponding path program 1 times [2018-12-31 21:13:25,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:25,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:25,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:25,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:25,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:25,670 INFO L87 Difference]: Start difference. First operand 6601 states and 15023 transitions. Second operand 4 states. [2018-12-31 21:13:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:26,254 INFO L93 Difference]: Finished difference Result 10288 states and 23294 transitions. [2018-12-31 21:13:26,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:13:26,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:13:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:26,268 INFO L225 Difference]: With dead ends: 10288 [2018-12-31 21:13:26,269 INFO L226 Difference]: Without dead ends: 10288 [2018-12-31 21:13:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2018-12-31 21:13:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 7721. [2018-12-31 21:13:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2018-12-31 21:13:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 17357 transitions. [2018-12-31 21:13:26,358 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 17357 transitions. Word has length 92 [2018-12-31 21:13:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:26,358 INFO L480 AbstractCegarLoop]: Abstraction has 7721 states and 17357 transitions. [2018-12-31 21:13:26,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 17357 transitions. [2018-12-31 21:13:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 21:13:26,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:26,366 INFO L402 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] [2018-12-31 21:13:26,366 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1127474233, now seen corresponding path program 2 times [2018-12-31 21:13:26,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:26,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:26,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:26,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:26,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:26,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:26,598 INFO L87 Difference]: Start difference. First operand 7721 states and 17357 transitions. Second operand 4 states. [2018-12-31 21:13:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:26,792 INFO L93 Difference]: Finished difference Result 8286 states and 18650 transitions. [2018-12-31 21:13:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 21:13:26,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 21:13:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:26,802 INFO L225 Difference]: With dead ends: 8286 [2018-12-31 21:13:26,802 INFO L226 Difference]: Without dead ends: 8286 [2018-12-31 21:13:26,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-31 21:13:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 7627. [2018-12-31 21:13:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2018-12-31 21:13:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 17252 transitions. [2018-12-31 21:13:26,914 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 17252 transitions. Word has length 92 [2018-12-31 21:13:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:26,914 INFO L480 AbstractCegarLoop]: Abstraction has 7627 states and 17252 transitions. [2018-12-31 21:13:26,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 17252 transitions. [2018-12-31 21:13:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:26,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:26,924 INFO L402 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] [2018-12-31 21:13:26,924 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 879761931, now seen corresponding path program 1 times [2018-12-31 21:13:26,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:26,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:26,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:13:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:27,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:27,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:13:27,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:13:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:13:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:27,295 INFO L87 Difference]: Start difference. First operand 7627 states and 17252 transitions. Second operand 7 states. [2018-12-31 21:13:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:28,099 INFO L93 Difference]: Finished difference Result 9401 states and 21200 transitions. [2018-12-31 21:13:28,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:28,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-31 21:13:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:28,112 INFO L225 Difference]: With dead ends: 9401 [2018-12-31 21:13:28,112 INFO L226 Difference]: Without dead ends: 9401 [2018-12-31 21:13:28,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2018-12-31 21:13:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 7739. [2018-12-31 21:13:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2018-12-31 21:13:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 17572 transitions. [2018-12-31 21:13:28,208 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 17572 transitions. Word has length 94 [2018-12-31 21:13:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:28,208 INFO L480 AbstractCegarLoop]: Abstraction has 7739 states and 17572 transitions. [2018-12-31 21:13:28,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:13:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 17572 transitions. [2018-12-31 21:13:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:28,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:28,219 INFO L402 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] [2018-12-31 21:13:28,219 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:28,219 INFO L82 PathProgramCache]: Analyzing trace with hash 45519536, now seen corresponding path program 1 times [2018-12-31 21:13:28,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:28,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:28,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:28,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:28,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:28,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:28,437 INFO L87 Difference]: Start difference. First operand 7739 states and 17572 transitions. Second operand 5 states. [2018-12-31 21:13:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:28,566 INFO L93 Difference]: Finished difference Result 8646 states and 19530 transitions. [2018-12-31 21:13:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:28,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 21:13:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:28,578 INFO L225 Difference]: With dead ends: 8646 [2018-12-31 21:13:28,578 INFO L226 Difference]: Without dead ends: 8646 [2018-12-31 21:13:28,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-12-31 21:13:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 6635. [2018-12-31 21:13:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6635 states. [2018-12-31 21:13:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 15091 transitions. [2018-12-31 21:13:28,660 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 15091 transitions. Word has length 94 [2018-12-31 21:13:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:28,660 INFO L480 AbstractCegarLoop]: Abstraction has 6635 states and 15091 transitions. [2018-12-31 21:13:28,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 15091 transitions. [2018-12-31 21:13:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:28,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:28,668 INFO L402 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] [2018-12-31 21:13:28,668 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -209217009, now seen corresponding path program 1 times [2018-12-31 21:13:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:28,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:28,969 INFO L87 Difference]: Start difference. First operand 6635 states and 15091 transitions. Second operand 5 states. [2018-12-31 21:13:29,155 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 21:13:29,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:29,785 INFO L93 Difference]: Finished difference Result 10801 states and 24708 transitions. [2018-12-31 21:13:29,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 21:13:29,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 21:13:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:29,800 INFO L225 Difference]: With dead ends: 10801 [2018-12-31 21:13:29,800 INFO L226 Difference]: Without dead ends: 10723 [2018-12-31 21:13:29,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:13:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10723 states. [2018-12-31 21:13:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10723 to 7776. [2018-12-31 21:13:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7776 states. [2018-12-31 21:13:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7776 states to 7776 states and 17738 transitions. [2018-12-31 21:13:29,923 INFO L78 Accepts]: Start accepts. Automaton has 7776 states and 17738 transitions. Word has length 94 [2018-12-31 21:13:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:29,923 INFO L480 AbstractCegarLoop]: Abstraction has 7776 states and 17738 transitions. [2018-12-31 21:13:29,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7776 states and 17738 transitions. [2018-12-31 21:13:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:29,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:29,932 INFO L402 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] [2018-12-31 21:13:29,932 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:29,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1035547472, now seen corresponding path program 1 times [2018-12-31 21:13:29,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:29,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:29,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:29,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:30,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:30,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:30,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:30,238 INFO L87 Difference]: Start difference. First operand 7776 states and 17738 transitions. Second operand 6 states. [2018-12-31 21:13:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:30,689 INFO L93 Difference]: Finished difference Result 9783 states and 22140 transitions. [2018-12-31 21:13:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 21:13:30,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-31 21:13:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:30,704 INFO L225 Difference]: With dead ends: 9783 [2018-12-31 21:13:30,704 INFO L226 Difference]: Without dead ends: 9704 [2018-12-31 21:13:30,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 21:13:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-31 21:13:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7375. [2018-12-31 21:13:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2018-12-31 21:13:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16848 transitions. [2018-12-31 21:13:30,816 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16848 transitions. Word has length 94 [2018-12-31 21:13:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:30,817 INFO L480 AbstractCegarLoop]: Abstraction has 7375 states and 16848 transitions. [2018-12-31 21:13:30,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16848 transitions. [2018-12-31 21:13:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:30,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:30,825 INFO L402 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] [2018-12-31 21:13:30,825 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash -202429449, now seen corresponding path program 1 times [2018-12-31 21:13:30,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:30,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:31,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:31,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:13:31,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:13:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:13:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:13:31,156 INFO L87 Difference]: Start difference. First operand 7375 states and 16848 transitions. Second operand 9 states. [2018-12-31 21:13:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:31,859 INFO L93 Difference]: Finished difference Result 10375 states and 23670 transitions. [2018-12-31 21:13:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 21:13:31,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-31 21:13:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:31,873 INFO L225 Difference]: With dead ends: 10375 [2018-12-31 21:13:31,873 INFO L226 Difference]: Without dead ends: 10343 [2018-12-31 21:13:31,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-31 21:13:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2018-12-31 21:13:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 9164. [2018-12-31 21:13:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-31 21:13:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 20930 transitions. [2018-12-31 21:13:31,988 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 20930 transitions. Word has length 94 [2018-12-31 21:13:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:31,989 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 20930 transitions. [2018-12-31 21:13:31,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:13:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 20930 transitions. [2018-12-31 21:13:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:32,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:32,001 INFO L402 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] [2018-12-31 21:13:32,001 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1999380808, now seen corresponding path program 1 times [2018-12-31 21:13:32,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:32,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:32,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:32,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 21:13:32,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 21:13:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 21:13:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:32,870 INFO L87 Difference]: Start difference. First operand 9164 states and 20930 transitions. Second operand 8 states. [2018-12-31 21:13:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:33,751 INFO L93 Difference]: Finished difference Result 14572 states and 33838 transitions. [2018-12-31 21:13:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 21:13:33,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-31 21:13:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:33,771 INFO L225 Difference]: With dead ends: 14572 [2018-12-31 21:13:33,771 INFO L226 Difference]: Without dead ends: 14572 [2018-12-31 21:13:33,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 21:13:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2018-12-31 21:13:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 9802. [2018-12-31 21:13:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9802 states. [2018-12-31 21:13:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 22597 transitions. [2018-12-31 21:13:33,995 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 22597 transitions. Word has length 94 [2018-12-31 21:13:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:33,995 INFO L480 AbstractCegarLoop]: Abstraction has 9802 states and 22597 transitions. [2018-12-31 21:13:33,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 21:13:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 22597 transitions. [2018-12-31 21:13:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 21:13:34,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:34,006 INFO L402 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] [2018-12-31 21:13:34,006 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1111877127, now seen corresponding path program 1 times [2018-12-31 21:13:34,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:34,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:34,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:34,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 21:13:34,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 21:13:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 21:13:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:34,131 INFO L87 Difference]: Start difference. First operand 9802 states and 22597 transitions. Second operand 3 states. [2018-12-31 21:13:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:34,180 INFO L93 Difference]: Finished difference Result 9546 states and 21781 transitions. [2018-12-31 21:13:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 21:13:34,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-31 21:13:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:34,192 INFO L225 Difference]: With dead ends: 9546 [2018-12-31 21:13:34,193 INFO L226 Difference]: Without dead ends: 9514 [2018-12-31 21:13:34,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 21:13:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9514 states. [2018-12-31 21:13:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9514 to 7524. [2018-12-31 21:13:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7524 states. [2018-12-31 21:13:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7524 states to 7524 states and 17032 transitions. [2018-12-31 21:13:34,292 INFO L78 Accepts]: Start accepts. Automaton has 7524 states and 17032 transitions. Word has length 94 [2018-12-31 21:13:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:34,292 INFO L480 AbstractCegarLoop]: Abstraction has 7524 states and 17032 transitions. [2018-12-31 21:13:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 21:13:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7524 states and 17032 transitions. [2018-12-31 21:13:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:34,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:34,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:34,302 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2106893768, now seen corresponding path program 1 times [2018-12-31 21:13:34,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:34,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:34,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:34,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 21:13:34,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 21:13:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 21:13:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 21:13:34,427 INFO L87 Difference]: Start difference. First operand 7524 states and 17032 transitions. Second operand 4 states. [2018-12-31 21:13:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:34,695 INFO L93 Difference]: Finished difference Result 8481 states and 19024 transitions. [2018-12-31 21:13:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 21:13:34,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-31 21:13:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:34,707 INFO L225 Difference]: With dead ends: 8481 [2018-12-31 21:13:34,707 INFO L226 Difference]: Without dead ends: 8414 [2018-12-31 21:13:34,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2018-12-31 21:13:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 7984. [2018-12-31 21:13:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7984 states. [2018-12-31 21:13:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7984 states to 7984 states and 17967 transitions. [2018-12-31 21:13:34,799 INFO L78 Accepts]: Start accepts. Automaton has 7984 states and 17967 transitions. Word has length 96 [2018-12-31 21:13:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 7984 states and 17967 transitions. [2018-12-31 21:13:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 21:13:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7984 states and 17967 transitions. [2018-12-31 21:13:34,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:34,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:34,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:34,808 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:34,808 INFO L82 PathProgramCache]: Analyzing trace with hash 110864185, now seen corresponding path program 1 times [2018-12-31 21:13:34,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:34,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:34,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:34,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:35,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:35,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 21:13:35,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 21:13:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 21:13:35,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:13:35,110 INFO L87 Difference]: Start difference. First operand 7984 states and 17967 transitions. Second operand 10 states. [2018-12-31 21:13:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:36,086 INFO L93 Difference]: Finished difference Result 10397 states and 23254 transitions. [2018-12-31 21:13:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 21:13:36,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 21:13:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:36,099 INFO L225 Difference]: With dead ends: 10397 [2018-12-31 21:13:36,099 INFO L226 Difference]: Without dead ends: 10397 [2018-12-31 21:13:36,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-12-31 21:13:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10397 states. [2018-12-31 21:13:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10397 to 9203. [2018-12-31 21:13:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9203 states. [2018-12-31 21:13:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9203 states to 9203 states and 20627 transitions. [2018-12-31 21:13:36,211 INFO L78 Accepts]: Start accepts. Automaton has 9203 states and 20627 transitions. Word has length 96 [2018-12-31 21:13:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:36,211 INFO L480 AbstractCegarLoop]: Abstraction has 9203 states and 20627 transitions. [2018-12-31 21:13:36,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 21:13:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 9203 states and 20627 transitions. [2018-12-31 21:13:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:36,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:36,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:36,221 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash 998367866, now seen corresponding path program 1 times [2018-12-31 21:13:36,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:36,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 21:13:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 21:13:36,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 21:13:36,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:36,555 INFO L87 Difference]: Start difference. First operand 9203 states and 20627 transitions. Second operand 7 states. [2018-12-31 21:13:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:36,756 INFO L93 Difference]: Finished difference Result 11920 states and 26646 transitions. [2018-12-31 21:13:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:36,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 21:13:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:36,771 INFO L225 Difference]: With dead ends: 11920 [2018-12-31 21:13:36,771 INFO L226 Difference]: Without dead ends: 11920 [2018-12-31 21:13:36,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 21:13:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11920 states. [2018-12-31 21:13:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11920 to 9153. [2018-12-31 21:13:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9153 states. [2018-12-31 21:13:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 20415 transitions. [2018-12-31 21:13:36,887 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 20415 transitions. Word has length 96 [2018-12-31 21:13:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:36,887 INFO L480 AbstractCegarLoop]: Abstraction has 9153 states and 20415 transitions. [2018-12-31 21:13:36,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 21:13:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 20415 transitions. [2018-12-31 21:13:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:36,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:36,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:36,897 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 322215098, now seen corresponding path program 1 times [2018-12-31 21:13:36,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:36,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 21:13:37,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 21:13:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 21:13:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 21:13:37,806 INFO L87 Difference]: Start difference. First operand 9153 states and 20415 transitions. Second operand 9 states. [2018-12-31 21:13:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:38,403 INFO L93 Difference]: Finished difference Result 10199 states and 22579 transitions. [2018-12-31 21:13:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-31 21:13:38,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-31 21:13:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:38,416 INFO L225 Difference]: With dead ends: 10199 [2018-12-31 21:13:38,417 INFO L226 Difference]: Without dead ends: 10199 [2018-12-31 21:13:38,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-31 21:13:38,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10199 states. [2018-12-31 21:13:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10199 to 7039. [2018-12-31 21:13:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7039 states. [2018-12-31 21:13:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 15667 transitions. [2018-12-31 21:13:38,515 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 15667 transitions. Word has length 96 [2018-12-31 21:13:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:38,515 INFO L480 AbstractCegarLoop]: Abstraction has 7039 states and 15667 transitions. [2018-12-31 21:13:38,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 21:13:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 15667 transitions. [2018-12-31 21:13:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:38,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:38,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:38,524 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:38,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1209718779, now seen corresponding path program 1 times [2018-12-31 21:13:38,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:38,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:38,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:38,704 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-31 21:13:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:38,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 21:13:38,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 21:13:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 21:13:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 21:13:38,789 INFO L87 Difference]: Start difference. First operand 7039 states and 15667 transitions. Second operand 11 states. [2018-12-31 21:13:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:40,516 INFO L93 Difference]: Finished difference Result 13691 states and 30658 transitions. [2018-12-31 21:13:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 21:13:40,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 21:13:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:40,530 INFO L225 Difference]: With dead ends: 13691 [2018-12-31 21:13:40,530 INFO L226 Difference]: Without dead ends: 9289 [2018-12-31 21:13:40,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 21:13:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-31 21:13:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 6880. [2018-12-31 21:13:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6880 states. [2018-12-31 21:13:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6880 states to 6880 states and 15274 transitions. [2018-12-31 21:13:40,617 INFO L78 Accepts]: Start accepts. Automaton has 6880 states and 15274 transitions. Word has length 96 [2018-12-31 21:13:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:40,617 INFO L480 AbstractCegarLoop]: Abstraction has 6880 states and 15274 transitions. [2018-12-31 21:13:40,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 21:13:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6880 states and 15274 transitions. [2018-12-31 21:13:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:40,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:40,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:40,625 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1847691802, now seen corresponding path program 1 times [2018-12-31 21:13:40,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:40,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:40,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:41,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:41,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 21:13:41,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 21:13:41,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 21:13:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 21:13:41,047 INFO L87 Difference]: Start difference. First operand 6880 states and 15274 transitions. Second operand 5 states. [2018-12-31 21:13:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:41,633 INFO L93 Difference]: Finished difference Result 6188 states and 13581 transitions. [2018-12-31 21:13:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 21:13:41,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 21:13:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:41,642 INFO L225 Difference]: With dead ends: 6188 [2018-12-31 21:13:41,642 INFO L226 Difference]: Without dead ends: 6188 [2018-12-31 21:13:41,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6188 states. [2018-12-31 21:13:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6188 to 5804. [2018-12-31 21:13:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5804 states. [2018-12-31 21:13:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 12771 transitions. [2018-12-31 21:13:41,705 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 12771 transitions. Word has length 96 [2018-12-31 21:13:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:41,705 INFO L480 AbstractCegarLoop]: Abstraction has 5804 states and 12771 transitions. [2018-12-31 21:13:41,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 21:13:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 12771 transitions. [2018-12-31 21:13:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:41,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:41,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:41,712 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash -157130344, now seen corresponding path program 2 times [2018-12-31 21:13:41,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:41,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:41,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:41,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:41,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:41,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:41,988 INFO L87 Difference]: Start difference. First operand 5804 states and 12771 transitions. Second operand 6 states. [2018-12-31 21:13:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:42,412 INFO L93 Difference]: Finished difference Result 6552 states and 14426 transitions. [2018-12-31 21:13:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 21:13:42,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 21:13:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:42,422 INFO L225 Difference]: With dead ends: 6552 [2018-12-31 21:13:42,422 INFO L226 Difference]: Without dead ends: 6552 [2018-12-31 21:13:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 21:13:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2018-12-31 21:13:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 5964. [2018-12-31 21:13:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2018-12-31 21:13:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 13115 transitions. [2018-12-31 21:13:42,490 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 13115 transitions. Word has length 96 [2018-12-31 21:13:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:42,491 INFO L480 AbstractCegarLoop]: Abstraction has 5964 states and 13115 transitions. [2018-12-31 21:13:42,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 13115 transitions. [2018-12-31 21:13:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:42,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:42,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:42,498 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2092257192, now seen corresponding path program 1 times [2018-12-31 21:13:42,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:42,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:42,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 21:13:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 21:13:42,936 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 21:13:43,456 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 21:13:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 21:13:43,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 21:13:43,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 21:13:43,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 21:13:43,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 21:13:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 21:13:43,490 INFO L87 Difference]: Start difference. First operand 5964 states and 13115 transitions. Second operand 6 states. [2018-12-31 21:13:44,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 21:13:44,530 INFO L93 Difference]: Finished difference Result 6824 states and 14847 transitions. [2018-12-31 21:13:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 21:13:44,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 21:13:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 21:13:44,539 INFO L225 Difference]: With dead ends: 6824 [2018-12-31 21:13:44,539 INFO L226 Difference]: Without dead ends: 6772 [2018-12-31 21:13:44,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 21:13:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2018-12-31 21:13:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 5838. [2018-12-31 21:13:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5838 states. [2018-12-31 21:13:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 12737 transitions. [2018-12-31 21:13:44,606 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 12737 transitions. Word has length 96 [2018-12-31 21:13:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 21:13:44,606 INFO L480 AbstractCegarLoop]: Abstraction has 5838 states and 12737 transitions. [2018-12-31 21:13:44,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 21:13:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 12737 transitions. [2018-12-31 21:13:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 21:13:44,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 21:13:44,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 21:13:44,614 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 21:13:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 21:13:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2018-12-31 21:13:44,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 21:13:44,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 21:13:44,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:44,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 21:13:44,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 21:13:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:13:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 21:13:44,703 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 21:13:44,892 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 21:13:44,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:13:44 BasicIcfg [2018-12-31 21:13:44,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 21:13:44,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 21:13:44,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 21:13:44,895 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 21:13:44,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:12:43" (3/4) ... [2018-12-31 21:13:44,901 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 21:13:45,122 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 21:13:45,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 21:13:45,127 INFO L168 Benchmark]: Toolchain (without parser) took 64311.47 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 946.0 MB in the beginning and 1.6 GB in the end (delta: -609.5 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,129 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:13:45,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 994.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,130 INFO L168 Benchmark]: Boogie Preprocessor took 51.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 21:13:45,130 INFO L168 Benchmark]: RCFGBuilder took 1188.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,130 INFO L168 Benchmark]: TraceAbstraction took 61758.15 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -578.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,133 INFO L168 Benchmark]: Witness Printer took 230.54 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-31 21:13:45,138 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 994.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1188.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61758.15 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -578.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 230.54 ms. Allocated memory is still 3.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1095; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1095, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1096; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1096, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 61.5s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10084 SDtfs, 11007 SDslu, 23459 SDs, 0 SdLazy, 10555 SolverSat, 616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 98 SyntacticMatches, 36 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 177702 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 2894 NumberOfCodeBlocks, 2894 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2761 ConstructedInterpolants, 0 QuantifiedInterpolants, 644404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...