./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_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 aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 18:34:35,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:34:35,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:34:35,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:34:35,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:34:35,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:34:35,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:34:35,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:34:35,961 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:34:35,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:34:35,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:34:35,970 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:34:35,971 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:34:35,974 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:34:35,977 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:34:35,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:34:35,981 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:34:35,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:34:35,987 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:34:35,990 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:34:35,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:34:35,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:34:36,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:34:36,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:34:36,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:34:36,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:34:36,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:34:36,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:34:36,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:34:36,013 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:34:36,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:34:36,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:34:36,015 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:34:36,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:34:36,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:34:36,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:34:36,019 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:34:36,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:34:36,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:34:36,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:34:36,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:34:36,051 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:34:36,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:34:36,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:34:36,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:34:36,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:34:36,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:34:36,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:34:36,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:34:36,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:34:36,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:34:36,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:34:36,054 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:34:36,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:34:36,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:34:36,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:34:36,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:34:36,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:34:36,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:34:36,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:34:36,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:34:36,057 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:34:36,057 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:34:36,057 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:34:36,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:34:36,058 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 -> aac2a7ad1130f4cb0499bd7cde65df0a82a8d241 [2018-12-31 18:34:36,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:34:36,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:34:36,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:34:36,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:34:36,157 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:34:36,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2018-12-31 18:34:36,215 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437b8ec6/6c4ad32cfad441678961016f156b410c/FLAG736859249 [2018-12-31 18:34:36,765 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:34:36,766 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix012_power.opt_false-unreach-call.i [2018-12-31 18:34:36,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437b8ec6/6c4ad32cfad441678961016f156b410c/FLAG736859249 [2018-12-31 18:34:37,057 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b437b8ec6/6c4ad32cfad441678961016f156b410c [2018-12-31 18:34:37,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:34:37,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:34:37,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:34:37,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:34:37,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:34:37,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:37,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f622d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37, skipping insertion in model container [2018-12-31 18:34:37,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:37,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:34:37,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:34:37,628 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:34:37,654 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:34:37,811 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:34:37,930 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:34:37,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37 WrapperNode [2018-12-31 18:34:37,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:34:37,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:34:37,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:34:37,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:34:37,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:37,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:34:38,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:34:38,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:34:38,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:34:38,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... [2018-12-31 18:34:38,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:34:38,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:34:38,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:34:38,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:34:38,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:34:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:34:38,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:34:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:34:38,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:34:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:34:38,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:34:38,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:34:38,156 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:34:39,299 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:34:39,299 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:34:39,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:39 BoogieIcfgContainer [2018-12-31 18:34:39,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:34:39,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:34:39,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:34:39,306 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:34:39,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:34:37" (1/3) ... [2018-12-31 18:34:39,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6753fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:34:39, skipping insertion in model container [2018-12-31 18:34:39,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:34:37" (2/3) ... [2018-12-31 18:34:39,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6753fd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:34:39, skipping insertion in model container [2018-12-31 18:34:39,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:39" (3/3) ... [2018-12-31 18:34:39,311 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.opt_false-unreach-call.i [2018-12-31 18:34:39,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,368 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,368 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,368 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,369 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,370 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,370 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,374 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,375 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,376 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,379 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,380 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,381 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,381 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,382 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,383 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,384 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,385 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,386 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,387 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,395 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:34:39,434 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:34:39,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:34:39,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:34:39,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:34:39,487 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:34:39,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:34:39,489 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:34:39,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:34:39,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:34:39,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:34:39,489 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:34:39,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:34:39,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:34:39,508 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-31 18:34:41,897 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-31 18:34:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-31 18:34:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 18:34:41,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:41,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:41,911 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-31 18:34:41,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:41,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:41,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:41,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:42,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:34:42,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:34:42,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:34:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:34:42,325 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-31 18:34:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:43,940 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-31 18:34:43,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:34:43,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-31 18:34:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:44,262 INFO L225 Difference]: With dead ends: 60791 [2018-12-31 18:34:44,262 INFO L226 Difference]: Without dead ends: 44271 [2018-12-31 18:34:44,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:34:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-31 18:34:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-31 18:34:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-31 18:34:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-31 18:34:46,125 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-31 18:34:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:46,126 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-31 18:34:46,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:34:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-31 18:34:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 18:34:46,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:46,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:46,138 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-31 18:34:46,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:46,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:46,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:34:46,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:34:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:34:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:34:46,329 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-31 18:34:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:49,575 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-31 18:34:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:34:49,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-31 18:34:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:49,886 INFO L225 Difference]: With dead ends: 64005 [2018-12-31 18:34:49,887 INFO L226 Difference]: Without dead ends: 63453 [2018-12-31 18:34:49,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:34:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-31 18:34:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-31 18:34:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-31 18:34:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-31 18:34:51,378 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-31 18:34:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:51,379 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-31 18:34:51,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:34:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-31 18:34:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-31 18:34:51,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:51,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:51,387 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:51,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:51,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-31 18:34:51,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:51,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:51,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:51,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:51,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:34:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:34:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:34:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:34:51,541 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-31 18:34:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:52,920 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-31 18:34:52,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:34:52,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-31 18:34:52,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:53,173 INFO L225 Difference]: With dead ends: 81367 [2018-12-31 18:34:53,173 INFO L226 Difference]: Without dead ends: 80855 [2018-12-31 18:34:53,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:34:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-31 18:34:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-31 18:34:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-31 18:34:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-31 18:34:55,292 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-31 18:34:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:55,293 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-31 18:34:55,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:34:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-31 18:34:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:34:55,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:55,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:55,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-31 18:34:55,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:55,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:55,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:55,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:55,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:34:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:34:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:34:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:34:55,374 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-31 18:34:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:55,688 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-31 18:34:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:34:55,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 18:34:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:55,829 INFO L225 Difference]: With dead ends: 65251 [2018-12-31 18:34:55,829 INFO L226 Difference]: Without dead ends: 65251 [2018-12-31 18:34:55,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:34:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-31 18:34:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-31 18:34:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-31 18:34:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-31 18:34:56,927 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-31 18:34:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:34:56,928 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-31 18:34:56,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:34:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-31 18:34:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:34:57,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:34:57,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:34:57,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:34:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:34:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-31 18:34:57,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:34:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:34:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:57,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:34:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:34:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:34:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:34:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:34:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:34:57,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:34:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:34:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:34:57,987 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-31 18:34:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:34:59,406 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-31 18:34:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:34:59,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:34:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:34:59,575 INFO L225 Difference]: With dead ends: 67511 [2018-12-31 18:34:59,575 INFO L226 Difference]: Without dead ends: 67511 [2018-12-31 18:34:59,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:34:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-31 18:35:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-31 18:35:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-31 18:35:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-31 18:35:00,790 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-31 18:35:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:00,790 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-31 18:35:00,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-31 18:35:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:00,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:00,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:00,811 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-31 18:35:00,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:00,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:00,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:00,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:00,969 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-31 18:35:02,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:02,980 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-31 18:35:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:35:02,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-31 18:35:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:03,195 INFO L225 Difference]: With dead ends: 88528 [2018-12-31 18:35:03,195 INFO L226 Difference]: Without dead ends: 88528 [2018-12-31 18:35:03,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-31 18:35:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-31 18:35:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-31 18:35:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-31 18:35:04,687 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-31 18:35:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:04,687 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-31 18:35:04,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-31 18:35:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:04,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:04,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:04,705 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-31 18:35:04,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:04,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:04,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:04,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:04,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:04,851 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-31 18:35:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:05,273 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-31 18:35:05,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:05,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-31 18:35:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:05,389 INFO L225 Difference]: With dead ends: 57182 [2018-12-31 18:35:05,389 INFO L226 Difference]: Without dead ends: 57182 [2018-12-31 18:35:05,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-31 18:35:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-31 18:35:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-31 18:35:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-31 18:35:07,023 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-31 18:35:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:07,023 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-31 18:35:07,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-31 18:35:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 18:35:07,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:07,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:07,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:07,033 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-31 18:35:07,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:07,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:07,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:07,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:07,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:07,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:07,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:07,384 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-31 18:35:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:08,567 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-31 18:35:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:35:08,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 18:35:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:08,776 INFO L225 Difference]: With dead ends: 97908 [2018-12-31 18:35:08,776 INFO L226 Difference]: Without dead ends: 97332 [2018-12-31 18:35:08,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:35:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-31 18:35:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-31 18:35:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-31 18:35:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-31 18:35:10,101 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-31 18:35:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:10,101 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-31 18:35:10,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-31 18:35:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 18:35:10,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:10,112 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] [2018-12-31 18:35:10,112 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-31 18:35:10,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:10,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:10,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:10,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:10,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:10,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:10,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:10,267 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 4 states. [2018-12-31 18:35:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:10,371 INFO L93 Difference]: Finished difference Result 12705 states and 39586 transitions. [2018-12-31 18:35:10,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:10,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-31 18:35:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:10,388 INFO L225 Difference]: With dead ends: 12705 [2018-12-31 18:35:10,388 INFO L226 Difference]: Without dead ends: 10887 [2018-12-31 18:35:10,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-31 18:35:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-31 18:35:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-31 18:35:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33402 transitions. [2018-12-31 18:35:10,526 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33402 transitions. Word has length 54 [2018-12-31 18:35:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:10,526 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33402 transitions. [2018-12-31 18:35:10,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:10,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33402 transitions. [2018-12-31 18:35:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:10,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:10,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:10,531 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-31 18:35:10,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:10,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:10,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:10,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:10,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:10,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:10,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:10,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:10,740 INFO L87 Difference]: Start difference. First operand 10839 states and 33402 transitions. Second operand 4 states. [2018-12-31 18:35:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:10,944 INFO L93 Difference]: Finished difference Result 12386 states and 38231 transitions. [2018-12-31 18:35:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:10,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-31 18:35:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:10,965 INFO L225 Difference]: With dead ends: 12386 [2018-12-31 18:35:10,965 INFO L226 Difference]: Without dead ends: 12386 [2018-12-31 18:35:10,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-31 18:35:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-31 18:35:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-31 18:35:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 35015 transitions. [2018-12-31 18:35:11,208 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 35015 transitions. Word has length 61 [2018-12-31 18:35:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:11,208 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 35015 transitions. [2018-12-31 18:35:11,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 35015 transitions. [2018-12-31 18:35:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-31 18:35:11,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:11,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:11,214 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-31 18:35:11,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:11,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:11,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:11,590 INFO L87 Difference]: Start difference. First operand 11359 states and 35015 transitions. Second operand 6 states. [2018-12-31 18:35:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:12,941 INFO L93 Difference]: Finished difference Result 20935 states and 64448 transitions. [2018-12-31 18:35:12,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:12,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-31 18:35:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:12,975 INFO L225 Difference]: With dead ends: 20935 [2018-12-31 18:35:12,975 INFO L226 Difference]: Without dead ends: 20864 [2018-12-31 18:35:12,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:35:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-31 18:35:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-31 18:35:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-31 18:35:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40712 transitions. [2018-12-31 18:35:13,224 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40712 transitions. Word has length 61 [2018-12-31 18:35:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:13,224 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40712 transitions. [2018-12-31 18:35:13,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40712 transitions. [2018-12-31 18:35:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:13,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:13,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:13,232 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-31 18:35:13,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:13,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:13,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:13,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:13,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:13,336 INFO L87 Difference]: Start difference. First operand 13298 states and 40712 transitions. Second operand 3 states. [2018-12-31 18:35:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:13,607 INFO L93 Difference]: Finished difference Result 13930 states and 42364 transitions. [2018-12-31 18:35:13,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:13,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:35:13,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:13,633 INFO L225 Difference]: With dead ends: 13930 [2018-12-31 18:35:13,634 INFO L226 Difference]: Without dead ends: 13930 [2018-12-31 18:35:13,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-31 18:35:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-31 18:35:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-31 18:35:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41538 transitions. [2018-12-31 18:35:13,837 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41538 transitions. Word has length 67 [2018-12-31 18:35:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:13,837 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41538 transitions. [2018-12-31 18:35:13,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41538 transitions. [2018-12-31 18:35:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:13,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:13,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:13,845 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-31 18:35:13,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:13,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:13,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:13,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:13,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:13,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:13,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:13,937 INFO L87 Difference]: Start difference. First operand 13614 states and 41538 transitions. Second operand 4 states. [2018-12-31 18:35:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:14,265 INFO L93 Difference]: Finished difference Result 17463 states and 52743 transitions. [2018-12-31 18:35:14,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:14,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:35:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:14,294 INFO L225 Difference]: With dead ends: 17463 [2018-12-31 18:35:14,294 INFO L226 Difference]: Without dead ends: 17463 [2018-12-31 18:35:14,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-31 18:35:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-31 18:35:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-31 18:35:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46198 transitions. [2018-12-31 18:35:14,509 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46198 transitions. Word has length 67 [2018-12-31 18:35:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:14,510 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46198 transitions. [2018-12-31 18:35:14,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46198 transitions. [2018-12-31 18:35:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:14,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:14,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:14,518 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-31 18:35:14,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:14,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:14,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:14,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:14,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:14,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:14,693 INFO L87 Difference]: Start difference. First operand 15244 states and 46198 transitions. Second operand 6 states. [2018-12-31 18:35:15,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:15,734 INFO L93 Difference]: Finished difference Result 18862 states and 56126 transitions. [2018-12-31 18:35:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:15,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:15,780 INFO L225 Difference]: With dead ends: 18862 [2018-12-31 18:35:15,780 INFO L226 Difference]: Without dead ends: 18862 [2018-12-31 18:35:15,780 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 [2018-12-31 18:35:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-31 18:35:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-31 18:35:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-31 18:35:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53178 transitions. [2018-12-31 18:35:16,038 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53178 transitions. Word has length 67 [2018-12-31 18:35:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:16,038 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53178 transitions. [2018-12-31 18:35:16,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53178 transitions. [2018-12-31 18:35:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:16,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:16,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:16,049 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-31 18:35:16,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:16,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:16,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:16,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:16,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:16,208 INFO L87 Difference]: Start difference. First operand 17720 states and 53178 transitions. Second operand 6 states. [2018-12-31 18:35:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:16,734 INFO L93 Difference]: Finished difference Result 20389 states and 59240 transitions. [2018-12-31 18:35:16,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:35:16,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-31 18:35:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:16,765 INFO L225 Difference]: With dead ends: 20389 [2018-12-31 18:35:16,765 INFO L226 Difference]: Without dead ends: 20389 [2018-12-31 18:35:16,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-31 18:35:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-31 18:35:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-31 18:35:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53189 transitions. [2018-12-31 18:35:17,038 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53189 transitions. Word has length 67 [2018-12-31 18:35:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:17,038 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53189 transitions. [2018-12-31 18:35:17,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53189 transitions. [2018-12-31 18:35:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:17,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:17,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:17,050 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-31 18:35:17,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:17,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:17,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:17,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:17,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:17,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:17,451 INFO L87 Difference]: Start difference. First operand 18002 states and 53189 transitions. Second operand 5 states. [2018-12-31 18:35:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:18,068 INFO L93 Difference]: Finished difference Result 23413 states and 68682 transitions. [2018-12-31 18:35:18,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:18,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:18,104 INFO L225 Difference]: With dead ends: 23413 [2018-12-31 18:35:18,104 INFO L226 Difference]: Without dead ends: 23413 [2018-12-31 18:35:18,104 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 [2018-12-31 18:35:18,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-31 18:35:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-31 18:35:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-31 18:35:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62593 transitions. [2018-12-31 18:35:18,405 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62593 transitions. Word has length 67 [2018-12-31 18:35:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:18,406 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62593 transitions. [2018-12-31 18:35:18,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62593 transitions. [2018-12-31 18:35:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:18,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:18,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:18,416 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-31 18:35:18,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:18,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:18,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:18,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:18,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:18,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:18,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:18,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:18,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:18,531 INFO L87 Difference]: Start difference. First operand 21350 states and 62593 transitions. Second operand 4 states. [2018-12-31 18:35:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:19,144 INFO L93 Difference]: Finished difference Result 26758 states and 78553 transitions. [2018-12-31 18:35:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:35:19,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:35:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:19,187 INFO L225 Difference]: With dead ends: 26758 [2018-12-31 18:35:19,187 INFO L226 Difference]: Without dead ends: 26462 [2018-12-31 18:35:19,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26462 states. [2018-12-31 18:35:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26462 to 25142. [2018-12-31 18:35:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25142 states. [2018-12-31 18:35:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25142 states to 25142 states and 73709 transitions. [2018-12-31 18:35:19,539 INFO L78 Accepts]: Start accepts. Automaton has 25142 states and 73709 transitions. Word has length 67 [2018-12-31 18:35:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:19,539 INFO L480 AbstractCegarLoop]: Abstraction has 25142 states and 73709 transitions. [2018-12-31 18:35:19,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 25142 states and 73709 transitions. [2018-12-31 18:35:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:19,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:19,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:19,552 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-31 18:35:19,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:19,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:19,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:19,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:19,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:19,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:19,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:19,667 INFO L87 Difference]: Start difference. First operand 25142 states and 73709 transitions. Second operand 5 states. [2018-12-31 18:35:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:19,755 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-31 18:35:19,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:19,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-31 18:35:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:19,764 INFO L225 Difference]: With dead ends: 7314 [2018-12-31 18:35:19,764 INFO L226 Difference]: Without dead ends: 6004 [2018-12-31 18:35:19,764 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 [2018-12-31 18:35:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-31 18:35:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-31 18:35:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-31 18:35:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-31 18:35:19,837 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-31 18:35:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:19,837 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-31 18:35:19,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-31 18:35:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:35:19,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:19,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:19,843 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-31 18:35:19,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:19,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:19,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:35:19,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:35:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:35:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:19,929 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-31 18:35:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:20,112 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-31 18:35:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:35:20,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:35:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:20,121 INFO L225 Difference]: With dead ends: 7126 [2018-12-31 18:35:20,121 INFO L226 Difference]: Without dead ends: 7126 [2018-12-31 18:35:20,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:35:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-31 18:35:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-31 18:35:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-31 18:35:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-31 18:35:20,186 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-31 18:35:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:20,186 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-31 18:35:20,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:35:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-31 18:35:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:35:20,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:20,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:20,192 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-31 18:35:20,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:20,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:20,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:20,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:20,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:20,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:20,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:20,490 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-31 18:35:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:20,684 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-31 18:35:20,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:35:20,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-31 18:35:20,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:20,694 INFO L225 Difference]: With dead ends: 6617 [2018-12-31 18:35:20,694 INFO L226 Difference]: Without dead ends: 6617 [2018-12-31 18:35:20,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-31 18:35:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-31 18:35:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-31 18:35:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-31 18:35:20,759 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-31 18:35:20,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:20,760 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-31 18:35:20,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:20,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-31 18:35:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 18:35:20,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:20,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:20,766 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-31 18:35:20,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:20,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:20,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:20,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:20,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:20,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:20,974 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-31 18:35:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:21,520 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-31 18:35:21,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:35:21,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-31 18:35:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:21,531 INFO L225 Difference]: With dead ends: 7099 [2018-12-31 18:35:21,531 INFO L226 Difference]: Without dead ends: 6980 [2018-12-31 18:35:21,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:35:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-31 18:35:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-31 18:35:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-31 18:35:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-31 18:35:21,612 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-31 18:35:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:21,612 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-31 18:35:21,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-31 18:35:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:21,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:21,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:21,621 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-31 18:35:21,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:21,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:21,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:21,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:21,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:21,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:21,906 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-31 18:35:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:23,363 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-31 18:35:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:23,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 18:35:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:23,371 INFO L225 Difference]: With dead ends: 5550 [2018-12-31 18:35:23,371 INFO L226 Difference]: Without dead ends: 5550 [2018-12-31 18:35:23,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-31 18:35:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-31 18:35:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-31 18:35:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-31 18:35:23,421 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-31 18:35:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:23,421 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-31 18:35:23,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-31 18:35:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:35:23,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:23,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:23,427 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1543718373, now seen corresponding path program 1 times [2018-12-31 18:35:23,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:23,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:23,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:23,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:23,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:23,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:35:23,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:35:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:35:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:35:23,664 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-31 18:35:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:23,951 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-31 18:35:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:35:23,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:35:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:23,961 INFO L225 Difference]: With dead ends: 6337 [2018-12-31 18:35:23,961 INFO L226 Difference]: Without dead ends: 6337 [2018-12-31 18:35:23,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-31 18:35:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-31 18:35:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-31 18:35:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-31 18:35:24,017 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-31 18:35:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:24,017 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-31 18:35:24,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:35:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-31 18:35:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:24,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:24,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:24,025 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:24,027 INFO L82 PathProgramCache]: Analyzing trace with hash 823121319, now seen corresponding path program 1 times [2018-12-31 18:35:24,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:24,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:24,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:24,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:24,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:24,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:24,224 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 7 states. [2018-12-31 18:35:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:25,706 INFO L93 Difference]: Finished difference Result 9573 states and 21333 transitions. [2018-12-31 18:35:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-31 18:35:25,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:25,718 INFO L225 Difference]: With dead ends: 9573 [2018-12-31 18:35:25,718 INFO L226 Difference]: Without dead ends: 9486 [2018-12-31 18:35:25,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-31 18:35:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9486 states. [2018-12-31 18:35:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9486 to 7509. [2018-12-31 18:35:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-31 18:35:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 16816 transitions. [2018-12-31 18:35:25,810 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 16816 transitions. Word has length 96 [2018-12-31 18:35:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:25,810 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 16816 transitions. [2018-12-31 18:35:25,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 16816 transitions. [2018-12-31 18:35:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:25,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:25,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:25,820 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1254088024, now seen corresponding path program 1 times [2018-12-31 18:35:25,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:25,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:25,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:25,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:26,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:26,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:26,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:26,057 INFO L87 Difference]: Start difference. First operand 7509 states and 16816 transitions. Second operand 6 states. [2018-12-31 18:35:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:26,470 INFO L93 Difference]: Finished difference Result 6652 states and 14633 transitions. [2018-12-31 18:35:26,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:26,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:35:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:26,480 INFO L225 Difference]: With dead ends: 6652 [2018-12-31 18:35:26,480 INFO L226 Difference]: Without dead ends: 6632 [2018-12-31 18:35:26,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6632 states. [2018-12-31 18:35:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6632 to 5635. [2018-12-31 18:35:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2018-12-31 18:35:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 12500 transitions. [2018-12-31 18:35:26,544 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 12500 transitions. Word has length 96 [2018-12-31 18:35:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:26,545 INFO L480 AbstractCegarLoop]: Abstraction has 5635 states and 12500 transitions. [2018-12-31 18:35:26,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 12500 transitions. [2018-12-31 18:35:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:26,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:26,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:26,551 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:26,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1437621095, now seen corresponding path program 1 times [2018-12-31 18:35:26,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:26,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:26,655 INFO L87 Difference]: Start difference. First operand 5635 states and 12500 transitions. Second operand 5 states. [2018-12-31 18:35:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:27,122 INFO L93 Difference]: Finished difference Result 6826 states and 15038 transitions. [2018-12-31 18:35:27,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:35:27,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:35:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:27,131 INFO L225 Difference]: With dead ends: 6826 [2018-12-31 18:35:27,132 INFO L226 Difference]: Without dead ends: 6761 [2018-12-31 18:35:27,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6761 states. [2018-12-31 18:35:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6761 to 6287. [2018-12-31 18:35:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2018-12-31 18:35:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 13887 transitions. [2018-12-31 18:35:27,203 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 13887 transitions. Word has length 96 [2018-12-31 18:35:27,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:27,204 INFO L480 AbstractCegarLoop]: Abstraction has 6287 states and 13887 transitions. [2018-12-31 18:35:27,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 13887 transitions. [2018-12-31 18:35:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:27,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:27,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:27,211 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1895732184, now seen corresponding path program 1 times [2018-12-31 18:35:27,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:27,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:27,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:27,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:35:27,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:35:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:35:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:35:27,408 INFO L87 Difference]: Start difference. First operand 6287 states and 13887 transitions. Second operand 5 states. [2018-12-31 18:35:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:27,713 INFO L93 Difference]: Finished difference Result 7428 states and 16365 transitions. [2018-12-31 18:35:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:27,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:35:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:27,723 INFO L225 Difference]: With dead ends: 7428 [2018-12-31 18:35:27,723 INFO L226 Difference]: Without dead ends: 7320 [2018-12-31 18:35:27,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2018-12-31 18:35:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 5841. [2018-12-31 18:35:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5841 states. [2018-12-31 18:35:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5841 states to 5841 states and 12979 transitions. [2018-12-31 18:35:27,794 INFO L78 Accepts]: Start accepts. Automaton has 5841 states and 12979 transitions. Word has length 96 [2018-12-31 18:35:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:27,795 INFO L480 AbstractCegarLoop]: Abstraction has 5841 states and 12979 transitions. [2018-12-31 18:35:27,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:35:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5841 states and 12979 transitions. [2018-12-31 18:35:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:27,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:27,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:27,801 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -17003224, now seen corresponding path program 2 times [2018-12-31 18:35:27,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:28,298 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2018-12-31 18:35:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:28,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:28,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:28,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:28,651 INFO L87 Difference]: Start difference. First operand 5841 states and 12979 transitions. Second operand 7 states. [2018-12-31 18:35:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:29,570 INFO L93 Difference]: Finished difference Result 7146 states and 15871 transitions. [2018-12-31 18:35:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:35:29,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:29,580 INFO L225 Difference]: With dead ends: 7146 [2018-12-31 18:35:29,580 INFO L226 Difference]: Without dead ends: 7146 [2018-12-31 18:35:29,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2018-12-31 18:35:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 5957. [2018-12-31 18:35:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5957 states. [2018-12-31 18:35:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 13242 transitions. [2018-12-31 18:35:29,645 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 13242 transitions. Word has length 96 [2018-12-31 18:35:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:29,645 INFO L480 AbstractCegarLoop]: Abstraction has 5957 states and 13242 transitions. [2018-12-31 18:35:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 13242 transitions. [2018-12-31 18:35:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:29,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:29,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:29,652 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:29,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:29,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1970478536, now seen corresponding path program 1 times [2018-12-31 18:35:29,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:29,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:35:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:29,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:35:29,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:35:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:35:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:29,980 INFO L87 Difference]: Start difference. First operand 5957 states and 13242 transitions. Second operand 9 states. [2018-12-31 18:35:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:30,849 INFO L93 Difference]: Finished difference Result 6448 states and 14298 transitions. [2018-12-31 18:35:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:30,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-31 18:35:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:30,858 INFO L225 Difference]: With dead ends: 6448 [2018-12-31 18:35:30,858 INFO L226 Difference]: Without dead ends: 6441 [2018-12-31 18:35:30,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-31 18:35:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5996. [2018-12-31 18:35:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2018-12-31 18:35:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13325 transitions. [2018-12-31 18:35:30,920 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13325 transitions. Word has length 96 [2018-12-31 18:35:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:30,920 INFO L480 AbstractCegarLoop]: Abstraction has 5996 states and 13325 transitions. [2018-12-31 18:35:30,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:35:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13325 transitions. [2018-12-31 18:35:30,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:30,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:30,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:30,927 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:30,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:30,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-31 18:35:30,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:30,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:30,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:31,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:31,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 18:35:31,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 18:35:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 18:35:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:31,604 INFO L87 Difference]: Start difference. First operand 5996 states and 13325 transitions. Second operand 10 states. [2018-12-31 18:35:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:32,465 INFO L93 Difference]: Finished difference Result 7262 states and 16093 transitions. [2018-12-31 18:35:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:35:32,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 18:35:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:32,475 INFO L225 Difference]: With dead ends: 7262 [2018-12-31 18:35:32,475 INFO L226 Difference]: Without dead ends: 7262 [2018-12-31 18:35:32,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:35:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2018-12-31 18:35:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 6320. [2018-12-31 18:35:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2018-12-31 18:35:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 14059 transitions. [2018-12-31 18:35:32,541 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 14059 transitions. Word has length 96 [2018-12-31 18:35:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:32,542 INFO L480 AbstractCegarLoop]: Abstraction has 6320 states and 14059 transitions. [2018-12-31 18:35:32,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 18:35:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 14059 transitions. [2018-12-31 18:35:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:32,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:32,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:32,549 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1225634166, now seen corresponding path program 1 times [2018-12-31 18:35:32,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:32,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:32,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:32,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:32,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:32,741 INFO L87 Difference]: Start difference. First operand 6320 states and 14059 transitions. Second operand 7 states. [2018-12-31 18:35:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:33,291 INFO L93 Difference]: Finished difference Result 7977 states and 17607 transitions. [2018-12-31 18:35:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:33,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:33,301 INFO L225 Difference]: With dead ends: 7977 [2018-12-31 18:35:33,301 INFO L226 Difference]: Without dead ends: 7977 [2018-12-31 18:35:33,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7977 states. [2018-12-31 18:35:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7977 to 6421. [2018-12-31 18:35:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6421 states. [2018-12-31 18:35:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 14260 transitions. [2018-12-31 18:35:33,371 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 14260 transitions. Word has length 96 [2018-12-31 18:35:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:33,371 INFO L480 AbstractCegarLoop]: Abstraction has 6421 states and 14260 transitions. [2018-12-31 18:35:33,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 14260 transitions. [2018-12-31 18:35:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:33,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:33,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:33,379 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1123855095, now seen corresponding path program 1 times [2018-12-31 18:35:33,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:33,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:33,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:33,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:33,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:33,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:33,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:33,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:33,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:33,851 INFO L87 Difference]: Start difference. First operand 6421 states and 14260 transitions. Second operand 6 states. [2018-12-31 18:35:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:34,234 INFO L93 Difference]: Finished difference Result 7605 states and 16862 transitions. [2018-12-31 18:35:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:34,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:35:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:34,244 INFO L225 Difference]: With dead ends: 7605 [2018-12-31 18:35:34,244 INFO L226 Difference]: Without dead ends: 7605 [2018-12-31 18:35:34,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:34,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7605 states. [2018-12-31 18:35:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7605 to 6373. [2018-12-31 18:35:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6373 states. [2018-12-31 18:35:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 14170 transitions. [2018-12-31 18:35:34,314 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 14170 transitions. Word has length 96 [2018-12-31 18:35:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:34,315 INFO L480 AbstractCegarLoop]: Abstraction has 6373 states and 14170 transitions. [2018-12-31 18:35:34,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 14170 transitions. [2018-12-31 18:35:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:34,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:34,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:34,322 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:34,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1105218985, now seen corresponding path program 1 times [2018-12-31 18:35:34,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:34,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:34,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:34,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:34,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:34,985 INFO L87 Difference]: Start difference. First operand 6373 states and 14170 transitions. Second operand 7 states. [2018-12-31 18:35:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:36,453 INFO L93 Difference]: Finished difference Result 7914 states and 17538 transitions. [2018-12-31 18:35:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-31 18:35:36,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:36,465 INFO L225 Difference]: With dead ends: 7914 [2018-12-31 18:35:36,465 INFO L226 Difference]: Without dead ends: 7914 [2018-12-31 18:35:36,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:35:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2018-12-31 18:35:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 7169. [2018-12-31 18:35:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7169 states. [2018-12-31 18:35:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 15869 transitions. [2018-12-31 18:35:36,548 INFO L78 Accepts]: Start accepts. Automaton has 7169 states and 15869 transitions. Word has length 96 [2018-12-31 18:35:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:36,548 INFO L480 AbstractCegarLoop]: Abstraction has 7169 states and 15869 transitions. [2018-12-31 18:35:36,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 15869 transitions. [2018-12-31 18:35:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:36,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:36,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:36,557 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:36,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1202266551, now seen corresponding path program 1 times [2018-12-31 18:35:36,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:36,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:36,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:37,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:37,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:37,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:37,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:37,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:37,436 INFO L87 Difference]: Start difference. First operand 7169 states and 15869 transitions. Second operand 8 states. [2018-12-31 18:35:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:37,894 INFO L93 Difference]: Finished difference Result 8091 states and 17646 transitions. [2018-12-31 18:35:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:35:37,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:35:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:37,904 INFO L225 Difference]: With dead ends: 8091 [2018-12-31 18:35:37,905 INFO L226 Difference]: Without dead ends: 8091 [2018-12-31 18:35:37,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:35:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2018-12-31 18:35:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 7196. [2018-12-31 18:35:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7196 states. [2018-12-31 18:35:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7196 states to 7196 states and 15841 transitions. [2018-12-31 18:35:37,983 INFO L78 Accepts]: Start accepts. Automaton has 7196 states and 15841 transitions. Word has length 96 [2018-12-31 18:35:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:37,983 INFO L480 AbstractCegarLoop]: Abstraction has 7196 states and 15841 transitions. [2018-12-31 18:35:37,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7196 states and 15841 transitions. [2018-12-31 18:35:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:37,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:37,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:37,991 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash -990915638, now seen corresponding path program 1 times [2018-12-31 18:35:37,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:37,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:37,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:38,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:38,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:35:38,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:35:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:35:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:38,192 INFO L87 Difference]: Start difference. First operand 7196 states and 15841 transitions. Second operand 8 states. [2018-12-31 18:35:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:38,606 INFO L93 Difference]: Finished difference Result 8191 states and 17933 transitions. [2018-12-31 18:35:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:35:38,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:35:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:38,618 INFO L225 Difference]: With dead ends: 8191 [2018-12-31 18:35:38,618 INFO L226 Difference]: Without dead ends: 8191 [2018-12-31 18:35:38,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:35:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states. [2018-12-31 18:35:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 6110. [2018-12-31 18:35:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6110 states. [2018-12-31 18:35:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 13380 transitions. [2018-12-31 18:35:38,687 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 13380 transitions. Word has length 96 [2018-12-31 18:35:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:38,688 INFO L480 AbstractCegarLoop]: Abstraction has 6110 states and 13380 transitions. [2018-12-31 18:35:38,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:35:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 13380 transitions. [2018-12-31 18:35:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:38,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:38,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:38,695 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-31 18:35:38,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:38,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:38,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:35:38,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:35:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:35:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:35:38,945 INFO L87 Difference]: Start difference. First operand 6110 states and 13380 transitions. Second operand 11 states. [2018-12-31 18:35:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:40,742 INFO L93 Difference]: Finished difference Result 11514 states and 25540 transitions. [2018-12-31 18:35:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 18:35:40,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-31 18:35:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:40,753 INFO L225 Difference]: With dead ends: 11514 [2018-12-31 18:35:40,753 INFO L226 Difference]: Without dead ends: 7375 [2018-12-31 18:35:40,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:35:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7375 states. [2018-12-31 18:35:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7375 to 5558. [2018-12-31 18:35:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2018-12-31 18:35:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 12163 transitions. [2018-12-31 18:35:40,820 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 12163 transitions. Word has length 96 [2018-12-31 18:35:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:40,820 INFO L480 AbstractCegarLoop]: Abstraction has 5558 states and 12163 transitions. [2018-12-31 18:35:40,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:35:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 12163 transitions. [2018-12-31 18:35:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:40,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:40,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:40,827 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -775363790, now seen corresponding path program 1 times [2018-12-31 18:35:40,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:40,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:41,677 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 15 [2018-12-31 18:35:41,999 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-12-31 18:35:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:42,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:42,013 INFO L87 Difference]: Start difference. First operand 5558 states and 12163 transitions. Second operand 7 states. [2018-12-31 18:35:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:42,364 INFO L93 Difference]: Finished difference Result 7502 states and 16259 transitions. [2018-12-31 18:35:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:35:42,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:42,374 INFO L225 Difference]: With dead ends: 7502 [2018-12-31 18:35:42,374 INFO L226 Difference]: Without dead ends: 7425 [2018-12-31 18:35:42,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:35:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7425 states. [2018-12-31 18:35:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7425 to 5939. [2018-12-31 18:35:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5939 states. [2018-12-31 18:35:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5939 states to 5939 states and 12990 transitions. [2018-12-31 18:35:42,444 INFO L78 Accepts]: Start accepts. Automaton has 5939 states and 12990 transitions. Word has length 96 [2018-12-31 18:35:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:42,445 INFO L480 AbstractCegarLoop]: Abstraction has 5939 states and 12990 transitions. [2018-12-31 18:35:42,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5939 states and 12990 transitions. [2018-12-31 18:35:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:42,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:42,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:42,454 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:42,454 INFO L82 PathProgramCache]: Analyzing trace with hash 186250227, now seen corresponding path program 1 times [2018-12-31 18:35:42,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:42,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:42,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:42,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:42,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:35:42,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:35:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:35:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:35:42,666 INFO L87 Difference]: Start difference. First operand 5939 states and 12990 transitions. Second operand 6 states. [2018-12-31 18:35:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:43,066 INFO L93 Difference]: Finished difference Result 6835 states and 14994 transitions. [2018-12-31 18:35:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:35:43,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:35:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:43,076 INFO L225 Difference]: With dead ends: 6835 [2018-12-31 18:35:43,076 INFO L226 Difference]: Without dead ends: 6835 [2018-12-31 18:35:43,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:35:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2018-12-31 18:35:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6115. [2018-12-31 18:35:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6115 states. [2018-12-31 18:35:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 13373 transitions. [2018-12-31 18:35:43,143 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 13373 transitions. Word has length 96 [2018-12-31 18:35:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:43,143 INFO L480 AbstractCegarLoop]: Abstraction has 6115 states and 13373 transitions. [2018-12-31 18:35:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:35:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 13373 transitions. [2018-12-31 18:35:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:43,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:43,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:43,151 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash 723124211, now seen corresponding path program 1 times [2018-12-31 18:35:43,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:43,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:43,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:43,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:35:43,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:35:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:35:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:35:43,479 INFO L87 Difference]: Start difference. First operand 6115 states and 13373 transitions. Second operand 9 states. [2018-12-31 18:35:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:44,106 INFO L93 Difference]: Finished difference Result 7374 states and 15945 transitions. [2018-12-31 18:35:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:35:44,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-31 18:35:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:44,116 INFO L225 Difference]: With dead ends: 7374 [2018-12-31 18:35:44,116 INFO L226 Difference]: Without dead ends: 7374 [2018-12-31 18:35:44,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:35:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2018-12-31 18:35:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 6469. [2018-12-31 18:35:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6469 states. [2018-12-31 18:35:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 14098 transitions. [2018-12-31 18:35:44,189 INFO L78 Accepts]: Start accepts. Automaton has 6469 states and 14098 transitions. Word has length 96 [2018-12-31 18:35:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:44,190 INFO L480 AbstractCegarLoop]: Abstraction has 6469 states and 14098 transitions. [2018-12-31 18:35:44,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:35:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6469 states and 14098 transitions. [2018-12-31 18:35:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:44,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:44,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:44,197 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:44,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1890597876, now seen corresponding path program 1 times [2018-12-31 18:35:44,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:44,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:35:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:35:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:35:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:35:44,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:35:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:35:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:35:44,401 INFO L87 Difference]: Start difference. First operand 6469 states and 14098 transitions. Second operand 7 states. [2018-12-31 18:35:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:35:44,593 INFO L93 Difference]: Finished difference Result 8363 states and 18345 transitions. [2018-12-31 18:35:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:35:44,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:35:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:35:44,606 INFO L225 Difference]: With dead ends: 8363 [2018-12-31 18:35:44,606 INFO L226 Difference]: Without dead ends: 8363 [2018-12-31 18:35:44,606 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 [2018-12-31 18:35:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2018-12-31 18:35:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 5605. [2018-12-31 18:35:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5605 states. [2018-12-31 18:35:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 12208 transitions. [2018-12-31 18:35:44,676 INFO L78 Accepts]: Start accepts. Automaton has 5605 states and 12208 transitions. Word has length 96 [2018-12-31 18:35:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:35:44,677 INFO L480 AbstractCegarLoop]: Abstraction has 5605 states and 12208 transitions. [2018-12-31 18:35:44,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:35:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5605 states and 12208 transitions. [2018-12-31 18:35:44,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:35:44,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:35:44,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:35:44,683 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:35:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:35:44,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-31 18:35:44,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:35:44,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:35:44,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:35:44,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:35:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:35:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:35:44,781 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:35:44,983 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:35:44,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:35:44 BasicIcfg [2018-12-31 18:35:44,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:35:44,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:35:44,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:35:44,987 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:35:44,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:34:39" (3/4) ... [2018-12-31 18:35:44,992 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:35:45,176 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:35:45,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:35:45,177 INFO L168 Benchmark]: Toolchain (without parser) took 68114.87 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 947.3 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 946.4 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,178 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:35:45,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.91 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,182 INFO L168 Benchmark]: Boogie Preprocessor took 53.39 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. [2018-12-31 18:35:45,182 INFO L168 Benchmark]: RCFGBuilder took 1228.34 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,182 INFO L168 Benchmark]: TraceAbstraction took 65683.38 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 922.5 MB. Max. memory is 11.5 GB. [2018-12-31 18:35:45,183 INFO L168 Benchmark]: Witness Printer took 190.43 ms. Allocated memory is still 4.6 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-31 18:35:45,189 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.14 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 867.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.91 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.39 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 1228.34 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.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65683.38 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 922.5 MB. Max. memory is 11.5 GB. * Witness Printer took 190.43 ms. Allocated memory is still 4.6 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t309; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t310; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 65.5s OverallTime, 41 OverallIterations, 1 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11181 SDtfs, 12677 SDslu, 27165 SDs, 0 SdLazy, 12567 SolverSat, 583 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 102 SyntacticMatches, 48 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 192684 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 3162 NumberOfCodeBlocks, 3162 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3026 ConstructedInterpolants, 0 QuantifiedInterpolants, 763443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...