./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/mix031_tso.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 bedc30426f84517809c1aba2f717b94ba4147624 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-13 01:22:49,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 01:22:49,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 01:22:49,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 01:22:49,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 01:22:49,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 01:22:49,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 01:22:49,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 01:22:49,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 01:22:49,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 01:22:49,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 01:22:49,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 01:22:49,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 01:22:49,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 01:22:49,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 01:22:49,830 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 01:22:49,831 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 01:22:49,833 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 01:22:49,835 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 01:22:49,837 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 01:22:49,838 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 01:22:49,839 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 01:22:49,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 01:22:49,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 01:22:49,844 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 01:22:49,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 01:22:49,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 01:22:49,849 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 01:22:49,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 01:22:49,853 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 01:22:49,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 01:22:49,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 01:22:49,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 01:22:49,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 01:22:49,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 01:22:49,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 01:22:49,860 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 01:22:49,889 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 01:22:49,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 01:22:49,890 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 01:22:49,891 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 01:22:49,891 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 01:22:49,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 01:22:49,892 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 01:22:49,893 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 01:22:49,893 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 01:22:49,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 01:22:49,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 01:22:49,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 01:22:49,894 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 01:22:49,894 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 01:22:49,895 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 01:22:49,895 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 01:22:49,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 01:22:49,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 01:22:49,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 01:22:49,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 01:22:49,896 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 01:22:49,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 01:22:49,896 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 01:22:49,897 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 01:22:49,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 01:22:49,899 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 01:22:49,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 01:22:49,899 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 01:22:49,900 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 -> bedc30426f84517809c1aba2f717b94ba4147624 [2019-01-13 01:22:49,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 01:22:49,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 01:22:49,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 01:22:49,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 01:22:49,995 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 01:22:49,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2019-01-13 01:22:50,054 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d837ffc/b0113032d15d422086a38d95b2a051c2/FLAGecf51787b [2019-01-13 01:22:50,551 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 01:22:50,552 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2019-01-13 01:22:50,571 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d837ffc/b0113032d15d422086a38d95b2a051c2/FLAGecf51787b [2019-01-13 01:22:50,854 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d837ffc/b0113032d15d422086a38d95b2a051c2 [2019-01-13 01:22:50,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 01:22:50,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 01:22:50,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:50,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 01:22:50,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 01:22:50,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:50" (1/1) ... [2019-01-13 01:22:50,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fb7911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:50, skipping insertion in model container [2019-01-13 01:22:50,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 01:22:50" (1/1) ... [2019-01-13 01:22:50,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 01:22:50,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 01:22:51,381 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:51,404 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 01:22:51,581 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 01:22:51,666 INFO L195 MainTranslator]: Completed translation [2019-01-13 01:22:51,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51 WrapperNode [2019-01-13 01:22:51,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 01:22:51,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:51,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 01:22:51,669 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 01:22:51,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 01:22:51,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 01:22:51,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 01:22:51,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 01:22:51,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (1/1) ... [2019-01-13 01:22:51,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 01:22:51,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 01:22:51,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 01:22:51,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 01:22:51,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (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 [2019-01-13 01:22:51,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 01:22:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 01:22:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 01:22:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 01:22:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 01:22:51,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 01:22:51,852 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 01:22:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 01:22:51,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 01:22:51,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 01:22:51,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 01:22:51,856 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 01:22:52,884 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 01:22:52,884 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 01:22:52,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:52 BoogieIcfgContainer [2019-01-13 01:22:52,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 01:22:52,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 01:22:52,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 01:22:52,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 01:22:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 01:22:50" (1/3) ... [2019-01-13 01:22:52,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f8beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:52, skipping insertion in model container [2019-01-13 01:22:52,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 01:22:51" (2/3) ... [2019-01-13 01:22:52,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132f8beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 01:22:52, skipping insertion in model container [2019-01-13 01:22:52,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:52" (3/3) ... [2019-01-13 01:22:52,896 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc_false-unreach-call.i [2019-01-13 01:22:52,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,953 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,953 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,954 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,954 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,955 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,955 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,959 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,960 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,961 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,962 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,973 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,974 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,975 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,975 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,976 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,977 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,977 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,978 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,979 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,984 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,985 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,986 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,987 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,988 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,989 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,990 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,991 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,992 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,993 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,996 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,997 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,998 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:52,999 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,000 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,001 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,002 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,003 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,004 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,005 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 01:22:53,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 01:22:53,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 01:22:53,059 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 01:22:53,077 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 01:22:53,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 01:22:53,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 01:22:53,107 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 01:22:53,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 01:22:53,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 01:22:53,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 01:22:53,107 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 01:22:53,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 01:22:53,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 01:22:53,122 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2019-01-13 01:22:55,521 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2019-01-13 01:22:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2019-01-13 01:22:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 01:22:55,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:22:55,534 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] [2019-01-13 01:22:55,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:22:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:22:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2019-01-13 01:22:55,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:22:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:22:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:55,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:22:55,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:22:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:22:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:22:55,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:22:55,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:22:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:22:55,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:22:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:55,923 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2019-01-13 01:22:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:22:57,739 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2019-01-13 01:22:57,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:22:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-13 01:22:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:22:58,182 INFO L225 Difference]: With dead ends: 60794 [2019-01-13 01:22:58,182 INFO L226 Difference]: Without dead ends: 44274 [2019-01-13 01:22:58,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:22:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2019-01-13 01:22:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2019-01-13 01:22:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2019-01-13 01:23:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2019-01-13 01:23:00,042 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2019-01-13 01:23:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:00,043 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2019-01-13 01:23:00,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2019-01-13 01:23:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 01:23:00,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:00,060 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] [2019-01-13 01:23:00,060 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:00,061 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2019-01-13 01:23:00,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:00,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:00,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:00,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:00,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:00,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:00,241 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 3 states. [2019-01-13 01:23:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:01,002 INFO L93 Difference]: Finished difference Result 27342 states and 105226 transitions. [2019-01-13 01:23:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:01,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-13 01:23:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:01,137 INFO L225 Difference]: With dead ends: 27342 [2019-01-13 01:23:01,137 INFO L226 Difference]: Without dead ends: 27342 [2019-01-13 01:23:01,138 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 [2019-01-13 01:23:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27342 states. [2019-01-13 01:23:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27342 to 27342. [2019-01-13 01:23:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2019-01-13 01:23:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105226 transitions. [2019-01-13 01:23:02,590 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105226 transitions. Word has length 49 [2019-01-13 01:23:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:02,591 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105226 transitions. [2019-01-13 01:23:02,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105226 transitions. [2019-01-13 01:23:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-13 01:23:02,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:02,597 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] [2019-01-13 01:23:02,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1687880217, now seen corresponding path program 1 times [2019-01-13 01:23:02,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:02,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:02,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:02,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:02,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:02,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:02,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:02,776 INFO L87 Difference]: Start difference. First operand 27342 states and 105226 transitions. Second operand 4 states. [2019-01-13 01:23:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:02,917 INFO L93 Difference]: Finished difference Result 8532 states and 28324 transitions. [2019-01-13 01:23:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:23:02,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-01-13 01:23:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:02,950 INFO L225 Difference]: With dead ends: 8532 [2019-01-13 01:23:02,951 INFO L226 Difference]: Without dead ends: 7470 [2019-01-13 01:23:02,952 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 [2019-01-13 01:23:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-01-13 01:23:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2019-01-13 01:23:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2019-01-13 01:23:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24616 transitions. [2019-01-13 01:23:03,135 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24616 transitions. Word has length 49 [2019-01-13 01:23:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:03,135 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24616 transitions. [2019-01-13 01:23:03,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24616 transitions. [2019-01-13 01:23:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-13 01:23:03,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:03,142 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] [2019-01-13 01:23:03,142 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2019-01-13 01:23:03,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:03,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:03,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:03,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:03,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:03,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:03,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:03,528 INFO L87 Difference]: Start difference. First operand 7470 states and 24616 transitions. Second operand 6 states. [2019-01-13 01:23:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:04,356 INFO L93 Difference]: Finished difference Result 9666 states and 31109 transitions. [2019-01-13 01:23:04,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:04,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-01-13 01:23:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:04,390 INFO L225 Difference]: With dead ends: 9666 [2019-01-13 01:23:04,391 INFO L226 Difference]: Without dead ends: 9598 [2019-01-13 01:23:04,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9598 states. [2019-01-13 01:23:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9598 to 9445. [2019-01-13 01:23:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-01-13 01:23:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30522 transitions. [2019-01-13 01:23:04,597 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30522 transitions. Word has length 50 [2019-01-13 01:23:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:04,598 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30522 transitions. [2019-01-13 01:23:04,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30522 transitions. [2019-01-13 01:23:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 01:23:04,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:04,602 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] [2019-01-13 01:23:04,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2019-01-13 01:23:04,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:04,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:04,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:04,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:04,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:04,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:04,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:04,690 INFO L87 Difference]: Start difference. First operand 9445 states and 30522 transitions. Second operand 3 states. [2019-01-13 01:23:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:04,877 INFO L93 Difference]: Finished difference Result 13283 states and 42597 transitions. [2019-01-13 01:23:04,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:04,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 01:23:04,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:04,917 INFO L225 Difference]: With dead ends: 13283 [2019-01-13 01:23:04,917 INFO L226 Difference]: Without dead ends: 13283 [2019-01-13 01:23:04,918 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 [2019-01-13 01:23:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2019-01-13 01:23:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2019-01-13 01:23:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2019-01-13 01:23:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31488 transitions. [2019-01-13 01:23:05,267 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31488 transitions. Word has length 52 [2019-01-13 01:23:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:05,268 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31488 transitions. [2019-01-13 01:23:05,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31488 transitions. [2019-01-13 01:23:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-13 01:23:05,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:05,273 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] [2019-01-13 01:23:05,274 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2019-01-13 01:23:05,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:05,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:05,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:05,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:05,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:05,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:05,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:05,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:05,458 INFO L87 Difference]: Start difference. First operand 9849 states and 31488 transitions. Second operand 6 states. [2019-01-13 01:23:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:06,660 INFO L93 Difference]: Finished difference Result 14207 states and 45036 transitions. [2019-01-13 01:23:06,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:23:06,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-01-13 01:23:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:06,685 INFO L225 Difference]: With dead ends: 14207 [2019-01-13 01:23:06,685 INFO L226 Difference]: Without dead ends: 14135 [2019-01-13 01:23:06,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 01:23:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2019-01-13 01:23:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2019-01-13 01:23:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2019-01-13 01:23:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34543 transitions. [2019-01-13 01:23:06,947 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34543 transitions. Word has length 56 [2019-01-13 01:23:06,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:06,947 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34543 transitions. [2019-01-13 01:23:06,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34543 transitions. [2019-01-13 01:23:06,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 01:23:06,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:06,956 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] [2019-01-13 01:23:06,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:06,956 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2019-01-13 01:23:06,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:06,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:06,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:06,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:07,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:07,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:07,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:07,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:07,109 INFO L87 Difference]: Start difference. First operand 10853 states and 34543 transitions. Second operand 4 states. [2019-01-13 01:23:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:07,371 INFO L93 Difference]: Finished difference Result 12400 states and 39552 transitions. [2019-01-13 01:23:07,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 01:23:07,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-01-13 01:23:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:07,393 INFO L225 Difference]: With dead ends: 12400 [2019-01-13 01:23:07,393 INFO L226 Difference]: Without dead ends: 12400 [2019-01-13 01:23:07,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2019-01-13 01:23:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2019-01-13 01:23:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2019-01-13 01:23:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36216 transitions. [2019-01-13 01:23:07,610 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36216 transitions. Word has length 64 [2019-01-13 01:23:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:07,610 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36216 transitions. [2019-01-13 01:23:07,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36216 transitions. [2019-01-13 01:23:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-13 01:23:07,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:07,617 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] [2019-01-13 01:23:07,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2019-01-13 01:23:07,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:07,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:07,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:07,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:23:08,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:23:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:23:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:08,046 INFO L87 Difference]: Start difference. First operand 11373 states and 36216 transitions. Second operand 8 states. [2019-01-13 01:23:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:09,313 INFO L93 Difference]: Finished difference Result 15745 states and 48962 transitions. [2019-01-13 01:23:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:09,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-01-13 01:23:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:09,340 INFO L225 Difference]: With dead ends: 15745 [2019-01-13 01:23:09,340 INFO L226 Difference]: Without dead ends: 15674 [2019-01-13 01:23:09,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-13 01:23:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-01-13 01:23:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 13759. [2019-01-13 01:23:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2019-01-13 01:23:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43248 transitions. [2019-01-13 01:23:09,564 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43248 transitions. Word has length 64 [2019-01-13 01:23:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:09,564 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43248 transitions. [2019-01-13 01:23:09,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43248 transitions. [2019-01-13 01:23:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:23:09,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:09,582 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] [2019-01-13 01:23:09,582 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:09,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:09,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2019-01-13 01:23:09,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:09,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:09,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:09,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:09,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:09,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:09,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:09,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:09,845 INFO L87 Difference]: Start difference. First operand 13759 states and 43248 transitions. Second operand 4 states. [2019-01-13 01:23:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:10,979 INFO L93 Difference]: Finished difference Result 17639 states and 54553 transitions. [2019-01-13 01:23:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:10,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-13 01:23:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:11,008 INFO L225 Difference]: With dead ends: 17639 [2019-01-13 01:23:11,008 INFO L226 Difference]: Without dead ends: 17639 [2019-01-13 01:23:11,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2019-01-13 01:23:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2019-01-13 01:23:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2019-01-13 01:23:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49099 transitions. [2019-01-13 01:23:11,254 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49099 transitions. Word has length 68 [2019-01-13 01:23:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:11,254 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49099 transitions. [2019-01-13 01:23:11,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49099 transitions. [2019-01-13 01:23:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-13 01:23:11,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:11,267 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] [2019-01-13 01:23:11,267 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2019-01-13 01:23:11,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:11,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:11,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:11,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:11,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:11,373 INFO L87 Difference]: Start difference. First operand 15797 states and 49099 transitions. Second operand 3 states. [2019-01-13 01:23:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:11,634 INFO L93 Difference]: Finished difference Result 16389 states and 50706 transitions. [2019-01-13 01:23:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:11,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-13 01:23:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:11,662 INFO L225 Difference]: With dead ends: 16389 [2019-01-13 01:23:11,662 INFO L226 Difference]: Without dead ends: 16389 [2019-01-13 01:23:11,662 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 [2019-01-13 01:23:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2019-01-13 01:23:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2019-01-13 01:23:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2019-01-13 01:23:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49949 transitions. [2019-01-13 01:23:11,910 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49949 transitions. Word has length 68 [2019-01-13 01:23:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:11,911 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49949 transitions. [2019-01-13 01:23:11,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49949 transitions. [2019-01-13 01:23:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:11,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:11,922 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] [2019-01-13 01:23:11,923 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2019-01-13 01:23:11,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:11,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:11,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:11,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:12,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:12,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:12,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:12,147 INFO L87 Difference]: Start difference. First operand 16113 states and 49949 transitions. Second operand 6 states. [2019-01-13 01:23:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:13,514 INFO L93 Difference]: Finished difference Result 19825 states and 60385 transitions. [2019-01-13 01:23:13,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:13,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-13 01:23:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:13,547 INFO L225 Difference]: With dead ends: 19825 [2019-01-13 01:23:13,547 INFO L226 Difference]: Without dead ends: 19825 [2019-01-13 01:23:13,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2019-01-13 01:23:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2019-01-13 01:23:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2019-01-13 01:23:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57173 transitions. [2019-01-13 01:23:13,812 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57173 transitions. Word has length 70 [2019-01-13 01:23:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:13,812 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57173 transitions. [2019-01-13 01:23:13,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57173 transitions. [2019-01-13 01:23:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:13,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:13,823 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] [2019-01-13 01:23:13,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2019-01-13 01:23:13,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:13,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:13,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:14,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:14,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:14,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:14,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:14,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:14,254 INFO L87 Difference]: Start difference. First operand 18621 states and 57173 transitions. Second operand 5 states. [2019-01-13 01:23:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:14,745 INFO L93 Difference]: Finished difference Result 24184 states and 73678 transitions. [2019-01-13 01:23:14,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:14,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:14,783 INFO L225 Difference]: With dead ends: 24184 [2019-01-13 01:23:14,783 INFO L226 Difference]: Without dead ends: 24184 [2019-01-13 01:23:14,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2019-01-13 01:23:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2019-01-13 01:23:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2019-01-13 01:23:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67098 transitions. [2019-01-13 01:23:15,094 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67098 transitions. Word has length 70 [2019-01-13 01:23:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:15,094 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67098 transitions. [2019-01-13 01:23:15,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67098 transitions. [2019-01-13 01:23:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:15,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:15,111 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] [2019-01-13 01:23:15,112 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2019-01-13 01:23:15,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:15,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:15,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:15,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:15,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:15,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:15,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:15,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:15,369 INFO L87 Difference]: Start difference. First operand 22021 states and 67098 transitions. Second operand 5 states. [2019-01-13 01:23:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:16,939 INFO L93 Difference]: Finished difference Result 30767 states and 92724 transitions. [2019-01-13 01:23:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:16,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:16,989 INFO L225 Difference]: With dead ends: 30767 [2019-01-13 01:23:16,989 INFO L226 Difference]: Without dead ends: 30767 [2019-01-13 01:23:16,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2019-01-13 01:23:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2019-01-13 01:23:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2019-01-13 01:23:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83415 transitions. [2019-01-13 01:23:17,387 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83415 transitions. Word has length 70 [2019-01-13 01:23:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:17,387 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83415 transitions. [2019-01-13 01:23:17,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83415 transitions. [2019-01-13 01:23:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:17,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:17,401 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] [2019-01-13 01:23:17,401 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:17,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2019-01-13 01:23:17,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:17,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:17,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:17,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:17,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:17,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:17,657 INFO L87 Difference]: Start difference. First operand 27531 states and 83415 transitions. Second operand 5 states. [2019-01-13 01:23:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:18,089 INFO L93 Difference]: Finished difference Result 8579 states and 21393 transitions. [2019-01-13 01:23:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 01:23:18,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-13 01:23:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:18,102 INFO L225 Difference]: With dead ends: 8579 [2019-01-13 01:23:18,102 INFO L226 Difference]: Without dead ends: 6751 [2019-01-13 01:23:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2019-01-13 01:23:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 5732. [2019-01-13 01:23:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5732 states. [2019-01-13 01:23:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5732 states to 5732 states and 13957 transitions. [2019-01-13 01:23:18,183 INFO L78 Accepts]: Start accepts. Automaton has 5732 states and 13957 transitions. Word has length 70 [2019-01-13 01:23:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:18,183 INFO L480 AbstractCegarLoop]: Abstraction has 5732 states and 13957 transitions. [2019-01-13 01:23:18,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 5732 states and 13957 transitions. [2019-01-13 01:23:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 01:23:18,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:18,190 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] [2019-01-13 01:23:18,191 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2019-01-13 01:23:18,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:18,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:18,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 01:23:18,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 01:23:18,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 01:23:18,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 01:23:18,257 INFO L87 Difference]: Start difference. First operand 5732 states and 13957 transitions. Second operand 3 states. [2019-01-13 01:23:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:18,317 INFO L93 Difference]: Finished difference Result 7772 states and 18816 transitions. [2019-01-13 01:23:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 01:23:18,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-01-13 01:23:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:18,326 INFO L225 Difference]: With dead ends: 7772 [2019-01-13 01:23:18,326 INFO L226 Difference]: Without dead ends: 7772 [2019-01-13 01:23:18,327 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 [2019-01-13 01:23:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2019-01-13 01:23:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 5633. [2019-01-13 01:23:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5633 states. [2019-01-13 01:23:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5633 states to 5633 states and 13442 transitions. [2019-01-13 01:23:18,400 INFO L78 Accepts]: Start accepts. Automaton has 5633 states and 13442 transitions. Word has length 70 [2019-01-13 01:23:18,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:18,401 INFO L480 AbstractCegarLoop]: Abstraction has 5633 states and 13442 transitions. [2019-01-13 01:23:18,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 01:23:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5633 states and 13442 transitions. [2019-01-13 01:23:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 01:23:18,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:18,408 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] [2019-01-13 01:23:18,409 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2019-01-13 01:23:18,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:18,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:18,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:18,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:18,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:18,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:18,621 INFO L87 Difference]: Start difference. First operand 5633 states and 13442 transitions. Second operand 5 states. [2019-01-13 01:23:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:18,851 INFO L93 Difference]: Finished difference Result 6693 states and 15951 transitions. [2019-01-13 01:23:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:18,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-01-13 01:23:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:18,861 INFO L225 Difference]: With dead ends: 6693 [2019-01-13 01:23:18,861 INFO L226 Difference]: Without dead ends: 6693 [2019-01-13 01:23:18,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2019-01-13 01:23:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 6111. [2019-01-13 01:23:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6111 states. [2019-01-13 01:23:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 14600 transitions. [2019-01-13 01:23:18,927 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 14600 transitions. Word has length 76 [2019-01-13 01:23:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:18,927 INFO L480 AbstractCegarLoop]: Abstraction has 6111 states and 14600 transitions. [2019-01-13 01:23:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 14600 transitions. [2019-01-13 01:23:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-13 01:23:18,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:18,936 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] [2019-01-13 01:23:18,936 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2019-01-13 01:23:18,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:18,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:19,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:19,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:23:19,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:23:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:23:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:19,078 INFO L87 Difference]: Start difference. First operand 6111 states and 14600 transitions. Second operand 7 states. [2019-01-13 01:23:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:19,588 INFO L93 Difference]: Finished difference Result 6985 states and 16495 transitions. [2019-01-13 01:23:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:19,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-13 01:23:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:19,598 INFO L225 Difference]: With dead ends: 6985 [2019-01-13 01:23:19,598 INFO L226 Difference]: Without dead ends: 6866 [2019-01-13 01:23:19,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-01-13 01:23:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6866 states. [2019-01-13 01:23:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6866 to 6121. [2019-01-13 01:23:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2019-01-13 01:23:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14530 transitions. [2019-01-13 01:23:19,662 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14530 transitions. Word has length 76 [2019-01-13 01:23:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:19,663 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14530 transitions. [2019-01-13 01:23:19,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:23:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14530 transitions. [2019-01-13 01:23:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:23:19,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:19,673 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] [2019-01-13 01:23:19,673 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash -89021245, now seen corresponding path program 1 times [2019-01-13 01:23:19,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:19,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:19,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:19,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:19,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:19,888 INFO L87 Difference]: Start difference. First operand 6121 states and 14530 transitions. Second operand 4 states. [2019-01-13 01:23:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:20,283 INFO L93 Difference]: Finished difference Result 9288 states and 22114 transitions. [2019-01-13 01:23:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:20,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 01:23:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:20,296 INFO L225 Difference]: With dead ends: 9288 [2019-01-13 01:23:20,296 INFO L226 Difference]: Without dead ends: 9288 [2019-01-13 01:23:20,296 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 [2019-01-13 01:23:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-01-13 01:23:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 7057. [2019-01-13 01:23:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-01-13 01:23:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 16657 transitions. [2019-01-13 01:23:20,380 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 16657 transitions. Word has length 95 [2019-01-13 01:23:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:20,380 INFO L480 AbstractCegarLoop]: Abstraction has 7057 states and 16657 transitions. [2019-01-13 01:23:20,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 16657 transitions. [2019-01-13 01:23:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:23:20,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:20,388 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] [2019-01-13 01:23:20,389 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash 886458727, now seen corresponding path program 2 times [2019-01-13 01:23:20,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:20,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:20,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:20,652 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 01:23:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:20,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:23:20,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:23:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:23:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:20,706 INFO L87 Difference]: Start difference. First operand 7057 states and 16657 transitions. Second operand 8 states. [2019-01-13 01:23:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:22,376 INFO L93 Difference]: Finished difference Result 21058 states and 50093 transitions. [2019-01-13 01:23:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 01:23:22,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-01-13 01:23:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:22,402 INFO L225 Difference]: With dead ends: 21058 [2019-01-13 01:23:22,402 INFO L226 Difference]: Without dead ends: 20994 [2019-01-13 01:23:22,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-01-13 01:23:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20994 states. [2019-01-13 01:23:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20994 to 11080. [2019-01-13 01:23:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-01-13 01:23:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 26841 transitions. [2019-01-13 01:23:22,837 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 26841 transitions. Word has length 95 [2019-01-13 01:23:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:22,838 INFO L480 AbstractCegarLoop]: Abstraction has 11080 states and 26841 transitions. [2019-01-13 01:23:22,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 26841 transitions. [2019-01-13 01:23:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-13 01:23:22,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:22,851 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] [2019-01-13 01:23:22,851 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash -910492632, now seen corresponding path program 1 times [2019-01-13 01:23:22,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:22,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:22,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:22,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:22,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:23,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:23,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 01:23:23,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 01:23:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 01:23:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 01:23:23,066 INFO L87 Difference]: Start difference. First operand 11080 states and 26841 transitions. Second operand 4 states. [2019-01-13 01:23:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:23,197 INFO L93 Difference]: Finished difference Result 11101 states and 26408 transitions. [2019-01-13 01:23:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 01:23:23,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-13 01:23:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:23,211 INFO L225 Difference]: With dead ends: 11101 [2019-01-13 01:23:23,211 INFO L226 Difference]: Without dead ends: 11101 [2019-01-13 01:23:23,211 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 [2019-01-13 01:23:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11101 states. [2019-01-13 01:23:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11101 to 10380. [2019-01-13 01:23:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10380 states. [2019-01-13 01:23:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10380 states to 10380 states and 24797 transitions. [2019-01-13 01:23:23,327 INFO L78 Accepts]: Start accepts. Automaton has 10380 states and 24797 transitions. Word has length 95 [2019-01-13 01:23:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:23,327 INFO L480 AbstractCegarLoop]: Abstraction has 10380 states and 24797 transitions. [2019-01-13 01:23:23,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 01:23:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10380 states and 24797 transitions. [2019-01-13 01:23:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:23,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:23,339 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, 1] [2019-01-13 01:23:23,340 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash -675933315, now seen corresponding path program 1 times [2019-01-13 01:23:23,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:23,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:23,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:23,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:23:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:23:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:23:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:23,607 INFO L87 Difference]: Start difference. First operand 10380 states and 24797 transitions. Second operand 7 states. [2019-01-13 01:23:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:25,353 INFO L93 Difference]: Finished difference Result 12618 states and 30195 transitions. [2019-01-13 01:23:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:25,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-01-13 01:23:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:25,371 INFO L225 Difference]: With dead ends: 12618 [2019-01-13 01:23:25,372 INFO L226 Difference]: Without dead ends: 12618 [2019-01-13 01:23:25,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2019-01-13 01:23:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 10481. [2019-01-13 01:23:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10481 states. [2019-01-13 01:23:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 25223 transitions. [2019-01-13 01:23:25,499 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 25223 transitions. Word has length 97 [2019-01-13 01:23:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:25,499 INFO L480 AbstractCegarLoop]: Abstraction has 10481 states and 25223 transitions. [2019-01-13 01:23:25,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:23:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 25223 transitions. [2019-01-13 01:23:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:25,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:25,512 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, 1] [2019-01-13 01:23:25,512 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1080620369, now seen corresponding path program 1 times [2019-01-13 01:23:25,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:25,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:25,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:25,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:25,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:25,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:25,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:25,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:25,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:25,705 INFO L87 Difference]: Start difference. First operand 10481 states and 25223 transitions. Second operand 5 states. [2019-01-13 01:23:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:25,841 INFO L93 Difference]: Finished difference Result 12192 states and 29184 transitions. [2019-01-13 01:23:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:25,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:23:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:25,858 INFO L225 Difference]: With dead ends: 12192 [2019-01-13 01:23:25,858 INFO L226 Difference]: Without dead ends: 12192 [2019-01-13 01:23:25,859 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 [2019-01-13 01:23:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12192 states. [2019-01-13 01:23:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12192 to 9299. [2019-01-13 01:23:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9299 states. [2019-01-13 01:23:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9299 states to 9299 states and 22343 transitions. [2019-01-13 01:23:25,977 INFO L78 Accepts]: Start accepts. Automaton has 9299 states and 22343 transitions. Word has length 97 [2019-01-13 01:23:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:25,977 INFO L480 AbstractCegarLoop]: Abstraction has 9299 states and 22343 transitions. [2019-01-13 01:23:25,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9299 states and 22343 transitions. [2019-01-13 01:23:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:25,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:25,990 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, 1] [2019-01-13 01:23:25,990 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:25,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1335356914, now seen corresponding path program 1 times [2019-01-13 01:23:25,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:25,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:25,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:25,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:25,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:26,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:26,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:26,147 INFO L87 Difference]: Start difference. First operand 9299 states and 22343 transitions. Second operand 5 states. [2019-01-13 01:23:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:26,696 INFO L93 Difference]: Finished difference Result 15539 states and 37182 transitions. [2019-01-13 01:23:26,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:26,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-01-13 01:23:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:26,718 INFO L225 Difference]: With dead ends: 15539 [2019-01-13 01:23:26,718 INFO L226 Difference]: Without dead ends: 15416 [2019-01-13 01:23:26,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15416 states. [2019-01-13 01:23:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15416 to 10715. [2019-01-13 01:23:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10715 states. [2019-01-13 01:23:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 25788 transitions. [2019-01-13 01:23:26,864 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 25788 transitions. Word has length 97 [2019-01-13 01:23:26,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:26,865 INFO L480 AbstractCegarLoop]: Abstraction has 10715 states and 25788 transitions. [2019-01-13 01:23:26,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 25788 transitions. [2019-01-13 01:23:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:26,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:26,877 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, 1] [2019-01-13 01:23:26,878 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:26,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:26,878 INFO L82 PathProgramCache]: Analyzing trace with hash -90592433, now seen corresponding path program 1 times [2019-01-13 01:23:26,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:26,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:27,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:27,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:23:27,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:23:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:23:27,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:27,184 INFO L87 Difference]: Start difference. First operand 10715 states and 25788 transitions. Second operand 9 states. [2019-01-13 01:23:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:28,031 INFO L93 Difference]: Finished difference Result 14843 states and 35647 transitions. [2019-01-13 01:23:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 01:23:28,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-01-13 01:23:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:28,051 INFO L225 Difference]: With dead ends: 14843 [2019-01-13 01:23:28,051 INFO L226 Difference]: Without dead ends: 14811 [2019-01-13 01:23:28,052 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 [2019-01-13 01:23:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14811 states. [2019-01-13 01:23:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14811 to 11461. [2019-01-13 01:23:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11461 states. [2019-01-13 01:23:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 27360 transitions. [2019-01-13 01:23:28,197 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 27360 transitions. Word has length 97 [2019-01-13 01:23:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:28,197 INFO L480 AbstractCegarLoop]: Abstraction has 11461 states and 27360 transitions. [2019-01-13 01:23:28,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:23:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 27360 transitions. [2019-01-13 01:23:28,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:28,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:28,210 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, 1] [2019-01-13 01:23:28,210 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:28,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1887543792, now seen corresponding path program 1 times [2019-01-13 01:23:28,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:28,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:28,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:28,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:23:28,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:23:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:23:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:28,362 INFO L87 Difference]: Start difference. First operand 11461 states and 27360 transitions. Second operand 8 states. [2019-01-13 01:23:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:29,089 INFO L93 Difference]: Finished difference Result 17621 states and 42463 transitions. [2019-01-13 01:23:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-13 01:23:29,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-01-13 01:23:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:29,112 INFO L225 Difference]: With dead ends: 17621 [2019-01-13 01:23:29,112 INFO L226 Difference]: Without dead ends: 17621 [2019-01-13 01:23:29,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-01-13 01:23:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17621 states. [2019-01-13 01:23:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17621 to 12115. [2019-01-13 01:23:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12115 states. [2019-01-13 01:23:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12115 states to 12115 states and 29102 transitions. [2019-01-13 01:23:29,281 INFO L78 Accepts]: Start accepts. Automaton has 12115 states and 29102 transitions. Word has length 97 [2019-01-13 01:23:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 12115 states and 29102 transitions. [2019-01-13 01:23:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12115 states and 29102 transitions. [2019-01-13 01:23:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:29,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:29,295 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, 1] [2019-01-13 01:23:29,296 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:29,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1000040111, now seen corresponding path program 1 times [2019-01-13 01:23:29,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:29,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:29,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:29,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 01:23:29,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 01:23:29,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 01:23:29,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:29,496 INFO L87 Difference]: Start difference. First operand 12115 states and 29102 transitions. Second operand 7 states. [2019-01-13 01:23:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:29,683 INFO L93 Difference]: Finished difference Result 15730 states and 37756 transitions. [2019-01-13 01:23:29,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:29,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-01-13 01:23:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:29,702 INFO L225 Difference]: With dead ends: 15730 [2019-01-13 01:23:29,702 INFO L226 Difference]: Without dead ends: 15730 [2019-01-13 01:23:29,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:23:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2019-01-13 01:23:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 11745. [2019-01-13 01:23:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11745 states. [2019-01-13 01:23:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11745 states to 11745 states and 27949 transitions. [2019-01-13 01:23:29,862 INFO L78 Accepts]: Start accepts. Automaton has 11745 states and 27949 transitions. Word has length 97 [2019-01-13 01:23:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:29,862 INFO L480 AbstractCegarLoop]: Abstraction has 11745 states and 27949 transitions. [2019-01-13 01:23:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 01:23:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 11745 states and 27949 transitions. [2019-01-13 01:23:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-13 01:23:29,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:29,877 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, 1] [2019-01-13 01:23:29,878 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1562951633, now seen corresponding path program 1 times [2019-01-13 01:23:29,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:29,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:29,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:30,313 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:23:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:30,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:30,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:30,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:30,462 INFO L87 Difference]: Start difference. First operand 11745 states and 27949 transitions. Second operand 6 states. [2019-01-13 01:23:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:30,651 INFO L93 Difference]: Finished difference Result 11473 states and 26997 transitions. [2019-01-13 01:23:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:30,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-01-13 01:23:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:30,669 INFO L225 Difference]: With dead ends: 11473 [2019-01-13 01:23:30,669 INFO L226 Difference]: Without dead ends: 11473 [2019-01-13 01:23:30,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11473 states. [2019-01-13 01:23:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11473 to 6898. [2019-01-13 01:23:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6898 states. [2019-01-13 01:23:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6898 states to 6898 states and 16208 transitions. [2019-01-13 01:23:30,805 INFO L78 Accepts]: Start accepts. Automaton has 6898 states and 16208 transitions. Word has length 97 [2019-01-13 01:23:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:30,806 INFO L480 AbstractCegarLoop]: Abstraction has 6898 states and 16208 transitions. [2019-01-13 01:23:30,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6898 states and 16208 transitions. [2019-01-13 01:23:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:30,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:30,814 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, 1, 1, 1] [2019-01-13 01:23:30,814 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2019-01-13 01:23:30,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:30,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:30,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:23:30,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:23:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:23:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:23:30,989 INFO L87 Difference]: Start difference. First operand 6898 states and 16208 transitions. Second operand 10 states. [2019-01-13 01:23:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:31,662 INFO L93 Difference]: Finished difference Result 8768 states and 20428 transitions. [2019-01-13 01:23:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 01:23:31,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-01-13 01:23:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:31,675 INFO L225 Difference]: With dead ends: 8768 [2019-01-13 01:23:31,675 INFO L226 Difference]: Without dead ends: 8768 [2019-01-13 01:23:31,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:23:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8768 states. [2019-01-13 01:23:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8768 to 8424. [2019-01-13 01:23:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8424 states. [2019-01-13 01:23:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8424 states to 8424 states and 19673 transitions. [2019-01-13 01:23:31,829 INFO L78 Accepts]: Start accepts. Automaton has 8424 states and 19673 transitions. Word has length 99 [2019-01-13 01:23:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:31,830 INFO L480 AbstractCegarLoop]: Abstraction has 8424 states and 19673 transitions. [2019-01-13 01:23:31,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:23:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8424 states and 19673 transitions. [2019-01-13 01:23:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:31,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:31,839 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, 1, 1, 1] [2019-01-13 01:23:31,840 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2019-01-13 01:23:31,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:31,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:31,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:32,070 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-13 01:23:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:32,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:32,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 01:23:32,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 01:23:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 01:23:32,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 01:23:32,175 INFO L87 Difference]: Start difference. First operand 8424 states and 19673 transitions. Second operand 10 states. [2019-01-13 01:23:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:33,273 INFO L93 Difference]: Finished difference Result 12287 states and 28663 transitions. [2019-01-13 01:23:33,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 01:23:33,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-01-13 01:23:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:33,286 INFO L225 Difference]: With dead ends: 12287 [2019-01-13 01:23:33,286 INFO L226 Difference]: Without dead ends: 9163 [2019-01-13 01:23:33,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-13 01:23:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9163 states. [2019-01-13 01:23:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9163 to 8557. [2019-01-13 01:23:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8557 states. [2019-01-13 01:23:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 19946 transitions. [2019-01-13 01:23:33,381 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 19946 transitions. Word has length 99 [2019-01-13 01:23:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 8557 states and 19946 transitions. [2019-01-13 01:23:33,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 01:23:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 19946 transitions. [2019-01-13 01:23:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:33,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:33,390 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, 1, 1, 1] [2019-01-13 01:23:33,391 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1814131433, now seen corresponding path program 1 times [2019-01-13 01:23:33,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:33,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:33,843 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-13 01:23:34,228 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2019-01-13 01:23:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 01:23:34,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 01:23:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 01:23:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 01:23:34,247 INFO L87 Difference]: Start difference. First operand 8557 states and 19946 transitions. Second operand 6 states. [2019-01-13 01:23:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:34,497 INFO L93 Difference]: Finished difference Result 9319 states and 20953 transitions. [2019-01-13 01:23:34,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 01:23:34,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-01-13 01:23:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:34,511 INFO L225 Difference]: With dead ends: 9319 [2019-01-13 01:23:34,511 INFO L226 Difference]: Without dead ends: 9273 [2019-01-13 01:23:34,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 01:23:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-01-13 01:23:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 7818. [2019-01-13 01:23:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7818 states. [2019-01-13 01:23:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7818 states to 7818 states and 17742 transitions. [2019-01-13 01:23:34,601 INFO L78 Accepts]: Start accepts. Automaton has 7818 states and 17742 transitions. Word has length 99 [2019-01-13 01:23:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:34,601 INFO L480 AbstractCegarLoop]: Abstraction has 7818 states and 17742 transitions. [2019-01-13 01:23:34,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 01:23:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7818 states and 17742 transitions. [2019-01-13 01:23:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:34,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:34,610 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, 1, 1, 1] [2019-01-13 01:23:34,610 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -705952148, now seen corresponding path program 1 times [2019-01-13 01:23:34,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:34,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:34,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 01:23:34,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 01:23:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 01:23:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 01:23:34,753 INFO L87 Difference]: Start difference. First operand 7818 states and 17742 transitions. Second operand 5 states. [2019-01-13 01:23:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:35,016 INFO L93 Difference]: Finished difference Result 9318 states and 20994 transitions. [2019-01-13 01:23:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 01:23:35,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-01-13 01:23:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:35,029 INFO L225 Difference]: With dead ends: 9318 [2019-01-13 01:23:35,030 INFO L226 Difference]: Without dead ends: 9240 [2019-01-13 01:23:35,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2019-01-13 01:23:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 7334. [2019-01-13 01:23:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7334 states. [2019-01-13 01:23:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7334 states to 7334 states and 16729 transitions. [2019-01-13 01:23:35,117 INFO L78 Accepts]: Start accepts. Automaton has 7334 states and 16729 transitions. Word has length 99 [2019-01-13 01:23:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:35,117 INFO L480 AbstractCegarLoop]: Abstraction has 7334 states and 16729 transitions. [2019-01-13 01:23:35,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 01:23:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7334 states and 16729 transitions. [2019-01-13 01:23:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:35,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:35,125 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, 1, 1, 1] [2019-01-13 01:23:35,126 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -12850451, now seen corresponding path program 2 times [2019-01-13 01:23:35,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 01:23:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:35,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:35,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 01:23:35,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 01:23:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 01:23:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 01:23:35,316 INFO L87 Difference]: Start difference. First operand 7334 states and 16729 transitions. Second operand 8 states. [2019-01-13 01:23:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:35,741 INFO L93 Difference]: Finished difference Result 8612 states and 19413 transitions. [2019-01-13 01:23:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 01:23:35,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-01-13 01:23:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:35,755 INFO L225 Difference]: With dead ends: 8612 [2019-01-13 01:23:35,755 INFO L226 Difference]: Without dead ends: 8612 [2019-01-13 01:23:35,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-13 01:23:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8612 states. [2019-01-13 01:23:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8612 to 7368. [2019-01-13 01:23:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7368 states. [2019-01-13 01:23:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7368 states to 7368 states and 16795 transitions. [2019-01-13 01:23:35,838 INFO L78 Accepts]: Start accepts. Automaton has 7368 states and 16795 transitions. Word has length 99 [2019-01-13 01:23:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:35,839 INFO L480 AbstractCegarLoop]: Abstraction has 7368 states and 16795 transitions. [2019-01-13 01:23:35,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 01:23:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 7368 states and 16795 transitions. [2019-01-13 01:23:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:35,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:35,847 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, 1, 1, 1] [2019-01-13 01:23:35,848 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2032139224, now seen corresponding path program 2 times [2019-01-13 01:23:35,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:35,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:35,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:36,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:36,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 01:23:36,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 01:23:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 01:23:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 01:23:36,075 INFO L87 Difference]: Start difference. First operand 7368 states and 16795 transitions. Second operand 9 states. [2019-01-13 01:23:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:36,288 INFO L93 Difference]: Finished difference Result 11231 states and 25723 transitions. [2019-01-13 01:23:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 01:23:36,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-01-13 01:23:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:36,294 INFO L225 Difference]: With dead ends: 11231 [2019-01-13 01:23:36,294 INFO L226 Difference]: Without dead ends: 4064 [2019-01-13 01:23:36,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-13 01:23:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2019-01-13 01:23:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 4064. [2019-01-13 01:23:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-01-13 01:23:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 9329 transitions. [2019-01-13 01:23:36,335 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 9329 transitions. Word has length 99 [2019-01-13 01:23:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:36,335 INFO L480 AbstractCegarLoop]: Abstraction has 4064 states and 9329 transitions. [2019-01-13 01:23:36,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 01:23:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 9329 transitions. [2019-01-13 01:23:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:36,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:36,340 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, 1, 1, 1] [2019-01-13 01:23:36,341 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1960406580, now seen corresponding path program 3 times [2019-01-13 01:23:36,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:36,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:36,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 01:23:36,624 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-13 01:23:36,786 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 01:23:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 01:23:37,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 01:23:37,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-13 01:23:37,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 01:23:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 01:23:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-13 01:23:37,311 INFO L87 Difference]: Start difference. First operand 4064 states and 9329 transitions. Second operand 11 states. [2019-01-13 01:23:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 01:23:38,429 INFO L93 Difference]: Finished difference Result 8600 states and 19880 transitions. [2019-01-13 01:23:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 01:23:38,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-01-13 01:23:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 01:23:38,441 INFO L225 Difference]: With dead ends: 8600 [2019-01-13 01:23:38,441 INFO L226 Difference]: Without dead ends: 5499 [2019-01-13 01:23:38,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-01-13 01:23:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-01-13 01:23:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4095. [2019-01-13 01:23:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4095 states. [2019-01-13 01:23:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 9345 transitions. [2019-01-13 01:23:38,494 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 9345 transitions. Word has length 99 [2019-01-13 01:23:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 01:23:38,494 INFO L480 AbstractCegarLoop]: Abstraction has 4095 states and 9345 transitions. [2019-01-13 01:23:38,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 01:23:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 9345 transitions. [2019-01-13 01:23:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-13 01:23:38,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 01:23:38,500 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, 1, 1, 1] [2019-01-13 01:23:38,501 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 01:23:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 01:23:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash 138150868, now seen corresponding path program 4 times [2019-01-13 01:23:38,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 01:23:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 01:23:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:38,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 01:23:38,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 01:23:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:23:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 01:23:38,609 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 01:23:38,803 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 01:23:38,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 01:23:38 BasicIcfg [2019-01-13 01:23:38,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 01:23:38,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 01:23:38,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 01:23:38,806 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 01:23:38,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 01:22:52" (3/4) ... [2019-01-13 01:23:38,813 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 01:23:38,999 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 01:23:39,000 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 01:23:39,002 INFO L168 Benchmark]: Toolchain (without parser) took 48142.09 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -365.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,002 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-13 01:23:39,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,003 INFO L168 Benchmark]: Boogie Preprocessor took 55.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 01:23:39,004 INFO L168 Benchmark]: RCFGBuilder took 1089.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,004 INFO L168 Benchmark]: TraceAbstraction took 45919.14 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -290.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,004 INFO L168 Benchmark]: Witness Printer took 193.69 ms. Allocated memory is still 3.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2019-01-13 01:23:39,012 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.16 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 806.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1089.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45919.14 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -290.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 193.69 ms. Allocated memory is still 3.0 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 45.7s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 24.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9056 SDtfs, 10087 SDslu, 22763 SDs, 0 SdLazy, 9449 SolverSat, 513 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 95 SyntacticMatches, 28 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34810occurred in iteration=0, 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: 8.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 86921 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2815 NumberOfCodeBlocks, 2815 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2682 ConstructedInterpolants, 0 QuantifiedInterpolants, 666269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...