./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db442b2b2190096040237cf0291b9e040559918a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 23:37:38,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 23:37:38,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 23:37:38,916 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 23:37:38,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 23:37:38,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 23:37:38,924 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 23:37:38,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 23:37:38,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 23:37:38,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 23:37:38,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 23:37:38,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 23:37:38,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 23:37:38,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 23:37:38,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 23:37:38,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 23:37:38,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 23:37:38,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 23:37:38,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 23:37:38,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 23:37:38,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 23:37:38,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 23:37:38,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 23:37:38,971 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 23:37:38,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 23:37:38,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 23:37:38,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 23:37:38,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 23:37:38,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 23:37:38,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 23:37:38,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 23:37:38,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 23:37:38,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 23:37:38,978 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 23:37:38,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 23:37:38,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 23:37:38,981 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 23:37:38,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 23:37:38,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 23:37:38,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 23:37:38,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 23:37:38,999 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 23:37:39,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 23:37:39,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 23:37:39,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 23:37:39,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 23:37:39,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 23:37:39,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 23:37:39,002 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 23:37:39,003 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 23:37:39,003 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 23:37:39,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 23:37:39,003 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 23:37:39,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 23:37:39,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 23:37:39,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 23:37:39,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 23:37:39,004 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 23:37:39,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 23:37:39,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 23:37:39,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 23:37:39,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 23:37:39,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 23:37:39,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 23:37:39,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 23:37:39,007 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 -> db442b2b2190096040237cf0291b9e040559918a [2018-12-31 23:37:39,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 23:37:39,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 23:37:39,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 23:37:39,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 23:37:39,065 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 23:37:39,066 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i [2018-12-31 23:37:39,127 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57ac026c/6d1fd70d0d1941c58991af81377afcd5/FLAG729ce9531 [2018-12-31 23:37:39,749 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 23:37:39,754 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe010_rmo.oepc_false-unreach-call.i [2018-12-31 23:37:39,775 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57ac026c/6d1fd70d0d1941c58991af81377afcd5/FLAG729ce9531 [2018-12-31 23:37:39,974 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57ac026c/6d1fd70d0d1941c58991af81377afcd5 [2018-12-31 23:37:39,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 23:37:39,980 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 23:37:39,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 23:37:39,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 23:37:39,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 23:37:39,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 11:37:39" (1/1) ... [2018-12-31 23:37:39,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2998007b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:39, skipping insertion in model container [2018-12-31 23:37:39,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 11:37:39" (1/1) ... [2018-12-31 23:37:40,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 23:37:40,070 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 23:37:40,600 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 23:37:40,627 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 23:37:40,892 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 23:37:40,986 INFO L195 MainTranslator]: Completed translation [2018-12-31 23:37:40,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40 WrapperNode [2018-12-31 23:37:40,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 23:37:40,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 23:37:40,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 23:37:40,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 23:37:40,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 23:37:41,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 23:37:41,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 23:37:41,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 23:37:41,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (1/1) ... [2018-12-31 23:37:41,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 23:37:41,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 23:37:41,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 23:37:41,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 23:37:41,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (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 23:37:41,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 23:37:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 23:37:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 23:37:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 23:37:41,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 23:37:41,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 23:37:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 23:37:41,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 23:37:41,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 23:37:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 23:37:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 23:37:41,238 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 23:37:42,586 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 23:37:42,586 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 23:37:42,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:37:42 BoogieIcfgContainer [2018-12-31 23:37:42,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 23:37:42,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 23:37:42,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 23:37:42,594 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 23:37:42,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 11:37:39" (1/3) ... [2018-12-31 23:37:42,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 11:37:42, skipping insertion in model container [2018-12-31 23:37:42,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 11:37:40" (2/3) ... [2018-12-31 23:37:42,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 11:37:42, skipping insertion in model container [2018-12-31 23:37:42,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:37:42" (3/3) ... [2018-12-31 23:37:42,599 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc_false-unreach-call.i [2018-12-31 23:37:42,640 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,641 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,641 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,641 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,641 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,643 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,643 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,643 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,644 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,645 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,652 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,653 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,654 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,656 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,656 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 23:37:42,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 23:37:42,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 23:37:42,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 23:37:42,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 23:37:42,738 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 23:37:42,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 23:37:42,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 23:37:42,740 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 23:37:42,740 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 23:37:42,740 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 23:37:42,740 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 23:37:42,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 23:37:42,741 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 23:37:42,756 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-31 23:37:44,680 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2018-12-31 23:37:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2018-12-31 23:37:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-31 23:37:44,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:44,692 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] [2018-12-31 23:37:44,696 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2018-12-31 23:37:44,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:44,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:45,004 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 23:37:45,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:45,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:45,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:45,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:45,030 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2018-12-31 23:37:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:46,443 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2018-12-31 23:37:46,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 23:37:46,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-31 23:37:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:46,839 INFO L225 Difference]: With dead ends: 45395 [2018-12-31 23:37:46,840 INFO L226 Difference]: Without dead ends: 40635 [2018-12-31 23:37:46,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2018-12-31 23:37:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2018-12-31 23:37:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2018-12-31 23:37:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2018-12-31 23:37:48,850 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2018-12-31 23:37:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:48,853 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2018-12-31 23:37:48,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2018-12-31 23:37:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 23:37:48,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:48,869 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] [2018-12-31 23:37:48,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2018-12-31 23:37:48,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:48,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:48,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:49,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 23:37:49,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:49,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:37:49,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:37:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:37:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:49,060 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2018-12-31 23:37:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:51,819 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2018-12-31 23:37:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:37:51,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-31 23:37:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:52,166 INFO L225 Difference]: With dead ends: 64837 [2018-12-31 23:37:52,166 INFO L226 Difference]: Without dead ends: 64677 [2018-12-31 23:37:52,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:37:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2018-12-31 23:37:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2018-12-31 23:37:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2018-12-31 23:37:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2018-12-31 23:37:54,170 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2018-12-31 23:37:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:54,172 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2018-12-31 23:37:54,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:37:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2018-12-31 23:37:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 23:37:54,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:54,178 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] [2018-12-31 23:37:54,178 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:54,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2018-12-31 23:37:54,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:54,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:54,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:54,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:54,319 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 23:37:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:54,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:54,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:54,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:54,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:54,321 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2018-12-31 23:37:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:54,417 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2018-12-31 23:37:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:54,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-31 23:37:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:54,454 INFO L225 Difference]: With dead ends: 12371 [2018-12-31 23:37:54,455 INFO L226 Difference]: Without dead ends: 11850 [2018-12-31 23:37:54,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2018-12-31 23:37:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2018-12-31 23:37:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2018-12-31 23:37:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2018-12-31 23:37:54,763 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2018-12-31 23:37:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:54,764 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2018-12-31 23:37:54,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2018-12-31 23:37:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 23:37:54,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:54,773 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] [2018-12-31 23:37:54,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:54,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2018-12-31 23:37:54,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:55,092 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 23:37:55,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:55,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:55,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:55,095 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2018-12-31 23:37:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:55,818 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2018-12-31 23:37:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:55,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-31 23:37:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:55,856 INFO L225 Difference]: With dead ends: 17026 [2018-12-31 23:37:55,856 INFO L226 Difference]: Without dead ends: 17026 [2018-12-31 23:37:55,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2018-12-31 23:37:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2018-12-31 23:37:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2018-12-31 23:37:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2018-12-31 23:37:56,270 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2018-12-31 23:37:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:56,271 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2018-12-31 23:37:56,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:37:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2018-12-31 23:37:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 23:37:56,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:56,281 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] [2018-12-31 23:37:56,282 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2018-12-31 23:37:56,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:56,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:56,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:56,593 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 23:37:56,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:56,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:37:56,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:37:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:37:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:37:56,596 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 6 states. [2018-12-31 23:37:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:58,219 INFO L93 Difference]: Finished difference Result 18606 states and 60861 transitions. [2018-12-31 23:37:58,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 23:37:58,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-31 23:37:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:58,273 INFO L225 Difference]: With dead ends: 18606 [2018-12-31 23:37:58,274 INFO L226 Difference]: Without dead ends: 18574 [2018-12-31 23:37:58,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-31 23:37:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18574 states. [2018-12-31 23:37:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18574 to 14418. [2018-12-31 23:37:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14418 states. [2018-12-31 23:37:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 47580 transitions. [2018-12-31 23:37:58,635 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 47580 transitions. Word has length 57 [2018-12-31 23:37:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:37:58,635 INFO L480 AbstractCegarLoop]: Abstraction has 14418 states and 47580 transitions. [2018-12-31 23:37:58,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:37:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 47580 transitions. [2018-12-31 23:37:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 23:37:58,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:37:58,663 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] [2018-12-31 23:37:58,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:37:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:37:58,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1122563706, now seen corresponding path program 1 times [2018-12-31 23:37:58,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:37:58,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:37:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:37:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:37:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:37:58,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 23:37:58,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:37:58,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:37:58,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:37:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:37:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:37:58,928 INFO L87 Difference]: Start difference. First operand 14418 states and 47580 transitions. Second operand 4 states. [2018-12-31 23:37:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:37:59,629 INFO L93 Difference]: Finished difference Result 23166 states and 75033 transitions. [2018-12-31 23:37:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:37:59,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-31 23:37:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:37:59,684 INFO L225 Difference]: With dead ends: 23166 [2018-12-31 23:37:59,685 INFO L226 Difference]: Without dead ends: 22990 [2018-12-31 23:37:59,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:37:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22990 states. [2018-12-31 23:38:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22990 to 19518. [2018-12-31 23:38:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19518 states. [2018-12-31 23:38:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19518 states to 19518 states and 64005 transitions. [2018-12-31 23:38:00,091 INFO L78 Accepts]: Start accepts. Automaton has 19518 states and 64005 transitions. Word has length 71 [2018-12-31 23:38:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:00,092 INFO L480 AbstractCegarLoop]: Abstraction has 19518 states and 64005 transitions. [2018-12-31 23:38:00,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:38:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 19518 states and 64005 transitions. [2018-12-31 23:38:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-31 23:38:00,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:00,131 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] [2018-12-31 23:38:00,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash 230745991, now seen corresponding path program 1 times [2018-12-31 23:38:00,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:00,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:00,304 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 23:38:00,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:38:00,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:38:00,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:38:00,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:38:00,306 INFO L87 Difference]: Start difference. First operand 19518 states and 64005 transitions. Second operand 5 states. [2018-12-31 23:38:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:00,356 INFO L93 Difference]: Finished difference Result 3426 states and 9184 transitions. [2018-12-31 23:38:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 23:38:00,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-31 23:38:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:00,361 INFO L225 Difference]: With dead ends: 3426 [2018-12-31 23:38:00,361 INFO L226 Difference]: Without dead ends: 3014 [2018-12-31 23:38:00,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:38:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2018-12-31 23:38:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2911. [2018-12-31 23:38:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2018-12-31 23:38:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 7787 transitions. [2018-12-31 23:38:00,398 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 7787 transitions. Word has length 71 [2018-12-31 23:38:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:00,399 INFO L480 AbstractCegarLoop]: Abstraction has 2911 states and 7787 transitions. [2018-12-31 23:38:00,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:38:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 7787 transitions. [2018-12-31 23:38:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:38:00,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:00,411 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] [2018-12-31 23:38:00,411 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1246078848, now seen corresponding path program 1 times [2018-12-31 23:38:00,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:00,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:00,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:00,586 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 23:38:00,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:00,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:38:00,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:38:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:38:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:38:00,589 INFO L87 Difference]: Start difference. First operand 2911 states and 7787 transitions. Second operand 4 states. [2018-12-31 23:38:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:00,950 INFO L93 Difference]: Finished difference Result 3948 states and 10239 transitions. [2018-12-31 23:38:00,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:38:00,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-31 23:38:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:00,956 INFO L225 Difference]: With dead ends: 3948 [2018-12-31 23:38:00,957 INFO L226 Difference]: Without dead ends: 3948 [2018-12-31 23:38:00,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:38:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2018-12-31 23:38:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3394. [2018-12-31 23:38:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2018-12-31 23:38:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 8914 transitions. [2018-12-31 23:38:01,014 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 8914 transitions. Word has length 90 [2018-12-31 23:38:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:01,014 INFO L480 AbstractCegarLoop]: Abstraction has 3394 states and 8914 transitions. [2018-12-31 23:38:01,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:38:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 8914 transitions. [2018-12-31 23:38:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:38:01,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:01,022 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] [2018-12-31 23:38:01,022 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:01,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1865541151, now seen corresponding path program 1 times [2018-12-31 23:38:01,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:01,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:01,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:01,542 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 23:38:01,552 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 23:38:01,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:01,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:38:01,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:38:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:38:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:38:01,553 INFO L87 Difference]: Start difference. First operand 3394 states and 8914 transitions. Second operand 6 states. [2018-12-31 23:38:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:01,745 INFO L93 Difference]: Finished difference Result 3602 states and 9284 transitions. [2018-12-31 23:38:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 23:38:01,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-12-31 23:38:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:01,750 INFO L225 Difference]: With dead ends: 3602 [2018-12-31 23:38:01,751 INFO L226 Difference]: Without dead ends: 3602 [2018-12-31 23:38:01,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-31 23:38:01,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2018-12-31 23:38:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3372. [2018-12-31 23:38:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3372 states. [2018-12-31 23:38:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 8797 transitions. [2018-12-31 23:38:01,804 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 8797 transitions. Word has length 90 [2018-12-31 23:38:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:01,804 INFO L480 AbstractCegarLoop]: Abstraction has 3372 states and 8797 transitions. [2018-12-31 23:38:01,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:38:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 8797 transitions. [2018-12-31 23:38:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:38:01,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:01,812 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] [2018-12-31 23:38:01,812 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash 840847230, now seen corresponding path program 1 times [2018-12-31 23:38:01,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:01,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:02,198 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 23:38:02,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:02,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:38:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:38:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:38:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:38:02,200 INFO L87 Difference]: Start difference. First operand 3372 states and 8797 transitions. Second operand 5 states. [2018-12-31 23:38:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:02,511 INFO L93 Difference]: Finished difference Result 4392 states and 11188 transitions. [2018-12-31 23:38:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:38:02,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-12-31 23:38:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:02,519 INFO L225 Difference]: With dead ends: 4392 [2018-12-31 23:38:02,519 INFO L226 Difference]: Without dead ends: 4392 [2018-12-31 23:38:02,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:38:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2018-12-31 23:38:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 3594. [2018-12-31 23:38:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3594 states. [2018-12-31 23:38:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 9293 transitions. [2018-12-31 23:38:02,566 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 9293 transitions. Word has length 90 [2018-12-31 23:38:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:02,566 INFO L480 AbstractCegarLoop]: Abstraction has 3594 states and 9293 transitions. [2018-12-31 23:38:02,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:38:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 9293 transitions. [2018-12-31 23:38:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:38:02,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:02,574 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] [2018-12-31 23:38:02,574 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1616042761, now seen corresponding path program 2 times [2018-12-31 23:38:02,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:02,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:02,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 23:38:02,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:02,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 23:38:02,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 23:38:02,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 23:38:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:38:02,776 INFO L87 Difference]: Start difference. First operand 3594 states and 9293 transitions. Second operand 4 states. [2018-12-31 23:38:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:03,391 INFO L93 Difference]: Finished difference Result 5130 states and 13284 transitions. [2018-12-31 23:38:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 23:38:03,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-31 23:38:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:03,399 INFO L225 Difference]: With dead ends: 5130 [2018-12-31 23:38:03,399 INFO L226 Difference]: Without dead ends: 5112 [2018-12-31 23:38:03,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 23:38:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5112 states. [2018-12-31 23:38:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5112 to 3636. [2018-12-31 23:38:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3636 states. [2018-12-31 23:38:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 9376 transitions. [2018-12-31 23:38:03,449 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 9376 transitions. Word has length 90 [2018-12-31 23:38:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:03,450 INFO L480 AbstractCegarLoop]: Abstraction has 3636 states and 9376 transitions. [2018-12-31 23:38:03,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 23:38:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 9376 transitions. [2018-12-31 23:38:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-31 23:38:03,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:03,457 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] [2018-12-31 23:38:03,457 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:03,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:03,458 INFO L82 PathProgramCache]: Analyzing trace with hash 100591209, now seen corresponding path program 1 times [2018-12-31 23:38:03,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:03,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:03,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 23:38:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:03,580 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 23:38:03,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:03,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 23:38:03,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 23:38:03,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 23:38:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 23:38:03,582 INFO L87 Difference]: Start difference. First operand 3636 states and 9376 transitions. Second operand 3 states. [2018-12-31 23:38:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:03,810 INFO L93 Difference]: Finished difference Result 3688 states and 9475 transitions. [2018-12-31 23:38:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 23:38:03,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-31 23:38:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:03,817 INFO L225 Difference]: With dead ends: 3688 [2018-12-31 23:38:03,818 INFO L226 Difference]: Without dead ends: 3688 [2018-12-31 23:38:03,818 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 23:38:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2018-12-31 23:38:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3658. [2018-12-31 23:38:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3658 states. [2018-12-31 23:38:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 9410 transitions. [2018-12-31 23:38:03,871 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 9410 transitions. Word has length 90 [2018-12-31 23:38:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:03,872 INFO L480 AbstractCegarLoop]: Abstraction has 3658 states and 9410 transitions. [2018-12-31 23:38:03,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 23:38:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 9410 transitions. [2018-12-31 23:38:03,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:03,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:03,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:03,880 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:03,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1619414373, now seen corresponding path program 1 times [2018-12-31 23:38:03,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:03,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:03,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:03,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:03,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:04,143 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 23:38:04,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:04,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 23:38:04,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 23:38:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 23:38:04,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 23:38:04,145 INFO L87 Difference]: Start difference. First operand 3658 states and 9410 transitions. Second operand 9 states. [2018-12-31 23:38:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:05,695 INFO L93 Difference]: Finished difference Result 7294 states and 18183 transitions. [2018-12-31 23:38:05,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 23:38:05,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-12-31 23:38:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:05,706 INFO L225 Difference]: With dead ends: 7294 [2018-12-31 23:38:05,706 INFO L226 Difference]: Without dead ends: 7262 [2018-12-31 23:38:05,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-12-31 23:38:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2018-12-31 23:38:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 4934. [2018-12-31 23:38:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2018-12-31 23:38:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 12543 transitions. [2018-12-31 23:38:05,776 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 12543 transitions. Word has length 92 [2018-12-31 23:38:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:05,777 INFO L480 AbstractCegarLoop]: Abstraction has 4934 states and 12543 transitions. [2018-12-31 23:38:05,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 23:38:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 12543 transitions. [2018-12-31 23:38:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:05,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:05,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:05,785 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1430788442, now seen corresponding path program 1 times [2018-12-31 23:38:05,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:05,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:05,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:05,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:05,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:06,042 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 23:38:06,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:06,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 23:38:06,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 23:38:06,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 23:38:06,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:38:06,044 INFO L87 Difference]: Start difference. First operand 4934 states and 12543 transitions. Second operand 7 states. [2018-12-31 23:38:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:06,716 INFO L93 Difference]: Finished difference Result 8015 states and 20164 transitions. [2018-12-31 23:38:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 23:38:06,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 23:38:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:06,727 INFO L225 Difference]: With dead ends: 8015 [2018-12-31 23:38:06,727 INFO L226 Difference]: Without dead ends: 7764 [2018-12-31 23:38:06,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:38:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2018-12-31 23:38:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 5020. [2018-12-31 23:38:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2018-12-31 23:38:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 12633 transitions. [2018-12-31 23:38:06,799 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 12633 transitions. Word has length 92 [2018-12-31 23:38:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:06,800 INFO L480 AbstractCegarLoop]: Abstraction has 5020 states and 12633 transitions. [2018-12-31 23:38:06,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 23:38:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 12633 transitions. [2018-12-31 23:38:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:06,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:06,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:06,808 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:06,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1693857927, now seen corresponding path program 1 times [2018-12-31 23:38:06,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:06,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:07,180 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-31 23:38:07,216 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 23:38:07,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:07,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:38:07,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:38:07,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:38:07,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:38:07,218 INFO L87 Difference]: Start difference. First operand 5020 states and 12633 transitions. Second operand 6 states. [2018-12-31 23:38:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:07,487 INFO L93 Difference]: Finished difference Result 3809 states and 9705 transitions. [2018-12-31 23:38:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:38:07,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 23:38:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:07,493 INFO L225 Difference]: With dead ends: 3809 [2018-12-31 23:38:07,493 INFO L226 Difference]: Without dead ends: 3809 [2018-12-31 23:38:07,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:38:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2018-12-31 23:38:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3597. [2018-12-31 23:38:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3597 states. [2018-12-31 23:38:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 9242 transitions. [2018-12-31 23:38:07,555 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 9242 transitions. Word has length 92 [2018-12-31 23:38:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:07,555 INFO L480 AbstractCegarLoop]: Abstraction has 3597 states and 9242 transitions. [2018-12-31 23:38:07,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:38:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 9242 transitions. [2018-12-31 23:38:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:07,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:07,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:07,565 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:07,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -638635949, now seen corresponding path program 1 times [2018-12-31 23:38:07,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:07,938 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 23:38:07,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:07,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 23:38:07,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 23:38:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 23:38:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:38:07,940 INFO L87 Difference]: Start difference. First operand 3597 states and 9242 transitions. Second operand 8 states. [2018-12-31 23:38:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:08,549 INFO L93 Difference]: Finished difference Result 4654 states and 11807 transitions. [2018-12-31 23:38:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 23:38:08,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-31 23:38:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:08,557 INFO L225 Difference]: With dead ends: 4654 [2018-12-31 23:38:08,557 INFO L226 Difference]: Without dead ends: 4622 [2018-12-31 23:38:08,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-31 23:38:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2018-12-31 23:38:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3732. [2018-12-31 23:38:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2018-12-31 23:38:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9517 transitions. [2018-12-31 23:38:08,622 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9517 transitions. Word has length 92 [2018-12-31 23:38:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:08,623 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9517 transitions. [2018-12-31 23:38:08,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 23:38:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9517 transitions. [2018-12-31 23:38:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:08,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:08,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:08,631 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 322978068, now seen corresponding path program 1 times [2018-12-31 23:38:08,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:08,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:08,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:08,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:08,926 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 23:38:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:08,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 23:38:08,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 23:38:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 23:38:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:38:08,928 INFO L87 Difference]: Start difference. First operand 3732 states and 9517 transitions. Second operand 7 states. [2018-12-31 23:38:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:09,275 INFO L93 Difference]: Finished difference Result 4887 states and 12337 transitions. [2018-12-31 23:38:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 23:38:09,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-31 23:38:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:09,283 INFO L225 Difference]: With dead ends: 4887 [2018-12-31 23:38:09,283 INFO L226 Difference]: Without dead ends: 4887 [2018-12-31 23:38:09,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:38:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2018-12-31 23:38:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4052. [2018-12-31 23:38:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4052 states. [2018-12-31 23:38:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 10367 transitions. [2018-12-31 23:38:09,334 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 10367 transitions. Word has length 92 [2018-12-31 23:38:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:09,334 INFO L480 AbstractCegarLoop]: Abstraction has 4052 states and 10367 transitions. [2018-12-31 23:38:09,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 23:38:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 10367 transitions. [2018-12-31 23:38:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:09,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:09,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:09,340 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1567742549, now seen corresponding path program 1 times [2018-12-31 23:38:09,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:09,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:09,543 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 23:38:09,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:09,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:38:09,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:38:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:38:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:38:09,544 INFO L87 Difference]: Start difference. First operand 4052 states and 10367 transitions. Second operand 5 states. [2018-12-31 23:38:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:09,595 INFO L93 Difference]: Finished difference Result 5996 states and 15588 transitions. [2018-12-31 23:38:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 23:38:09,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-31 23:38:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:09,605 INFO L225 Difference]: With dead ends: 5996 [2018-12-31 23:38:09,605 INFO L226 Difference]: Without dead ends: 5996 [2018-12-31 23:38:09,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:38:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2018-12-31 23:38:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3732. [2018-12-31 23:38:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3732 states. [2018-12-31 23:38:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 9430 transitions. [2018-12-31 23:38:09,680 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 9430 transitions. Word has length 92 [2018-12-31 23:38:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:09,680 INFO L480 AbstractCegarLoop]: Abstraction has 3732 states and 9430 transitions. [2018-12-31 23:38:09,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:38:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 9430 transitions. [2018-12-31 23:38:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 23:38:09,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:09,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 23:38:09,687 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2048458965, now seen corresponding path program 1 times [2018-12-31 23:38:09,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:09,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:09,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:10,067 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 23:38:10,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:10,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 23:38:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 23:38:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 23:38:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 23:38:10,069 INFO L87 Difference]: Start difference. First operand 3732 states and 9430 transitions. Second operand 6 states. [2018-12-31 23:38:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:10,307 INFO L93 Difference]: Finished difference Result 3300 states and 8142 transitions. [2018-12-31 23:38:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:38:10,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-31 23:38:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:10,313 INFO L225 Difference]: With dead ends: 3300 [2018-12-31 23:38:10,313 INFO L226 Difference]: Without dead ends: 3300 [2018-12-31 23:38:10,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 23:38:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2018-12-31 23:38:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2619. [2018-12-31 23:38:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2018-12-31 23:38:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 6636 transitions. [2018-12-31 23:38:10,356 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 6636 transitions. Word has length 92 [2018-12-31 23:38:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:10,357 INFO L480 AbstractCegarLoop]: Abstraction has 2619 states and 6636 transitions. [2018-12-31 23:38:10,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 23:38:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 6636 transitions. [2018-12-31 23:38:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:38:10,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:10,362 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 23:38:10,362 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2018-12-31 23:38:10,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:10,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:10,784 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 23:38:10,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:10,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 23:38:10,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 23:38:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 23:38:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 23:38:10,786 INFO L87 Difference]: Start difference. First operand 2619 states and 6636 transitions. Second operand 5 states. [2018-12-31 23:38:11,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:11,013 INFO L93 Difference]: Finished difference Result 2971 states and 7500 transitions. [2018-12-31 23:38:11,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 23:38:11,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-31 23:38:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:11,018 INFO L225 Difference]: With dead ends: 2971 [2018-12-31 23:38:11,018 INFO L226 Difference]: Without dead ends: 2939 [2018-12-31 23:38:11,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 23:38:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2018-12-31 23:38:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2667. [2018-12-31 23:38:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2018-12-31 23:38:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6740 transitions. [2018-12-31 23:38:11,303 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6740 transitions. Word has length 94 [2018-12-31 23:38:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:11,303 INFO L480 AbstractCegarLoop]: Abstraction has 2667 states and 6740 transitions. [2018-12-31 23:38:11,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 23:38:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6740 transitions. [2018-12-31 23:38:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:38:11,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:11,307 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 23:38:11,307 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2018-12-31 23:38:11,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:11,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:11,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 23:38:11,540 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 23:38:11,618 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 23:38:11,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 23:38:11,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 23:38:11,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 23:38:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 23:38:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-31 23:38:11,619 INFO L87 Difference]: Start difference. First operand 2667 states and 6740 transitions. Second operand 12 states. [2018-12-31 23:38:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 23:38:12,451 INFO L93 Difference]: Finished difference Result 4454 states and 11424 transitions. [2018-12-31 23:38:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 23:38:12,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-31 23:38:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 23:38:12,458 INFO L225 Difference]: With dead ends: 4454 [2018-12-31 23:38:12,458 INFO L226 Difference]: Without dead ends: 3478 [2018-12-31 23:38:12,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-31 23:38:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2018-12-31 23:38:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3198. [2018-12-31 23:38:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2018-12-31 23:38:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 7987 transitions. [2018-12-31 23:38:12,497 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 7987 transitions. Word has length 94 [2018-12-31 23:38:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 23:38:12,497 INFO L480 AbstractCegarLoop]: Abstraction has 3198 states and 7987 transitions. [2018-12-31 23:38:12,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 23:38:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 7987 transitions. [2018-12-31 23:38:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 23:38:12,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 23:38:12,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:12,502 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 23:38:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 23:38:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2018-12-31 23:38:12,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 23:38:12,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 23:38:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 23:38:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 23:38:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 23:38:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 23:38:12,596 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 23:38:12,828 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 23:38:12,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 11:38:12 BasicIcfg [2018-12-31 23:38:12,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 23:38:12,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 23:38:12,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 23:38:12,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 23:38:12,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 11:37:42" (3/4) ... [2018-12-31 23:38:12,839 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 23:38:13,052 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 23:38:13,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 23:38:13,054 INFO L168 Benchmark]: Toolchain (without parser) took 33074.84 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 943.3 MB in the beginning and 1.7 GB in the end (delta: -711.3 MB). Peak memory consumption was 615.1 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,056 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 23:38:13,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1006.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,057 INFO L168 Benchmark]: Boogie Preprocessor took 58.73 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 23:38:13,059 INFO L168 Benchmark]: RCFGBuilder took 1450.84 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,059 INFO L168 Benchmark]: TraceAbstraction took 30241.75 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -652.6 MB). Peak memory consumption was 537.5 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,059 INFO L168 Benchmark]: Witness Printer took 220.36 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2018-12-31 23:38:13,065 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1006.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.73 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 1450.84 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30241.75 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -652.6 MB). Peak memory consumption was 537.5 MB. Max. memory is 11.5 GB. * Witness Printer took 220.36 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L755] -1 pthread_t t2019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L756] FCALL, FORK -1 pthread_create(&t2019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 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_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 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) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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=2] [L733] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, 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)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] 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=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L715] 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 [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] 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=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L717] 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 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 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) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] 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=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, 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] [L735] 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 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 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=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, 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] [L737] 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -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) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -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 [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -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 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L776] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L778] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 30.1s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 14.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4844 SDtfs, 4668 SDslu, 11286 SDs, 0 SdLazy, 4559 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred in iteration=2, 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: 6.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 69959 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1751 NumberOfCodeBlocks, 1751 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1636 ConstructedInterpolants, 0 QuantifiedInterpolants, 361840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...