./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/mix009_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/mix009_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 d09e5902c3e47c1de0260aa103bb8e06a6e05e27 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 18:24:09,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 18:24:09,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 18:24:09,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 18:24:09,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 18:24:09,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 18:24:09,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 18:24:09,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 18:24:09,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 18:24:09,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 18:24:09,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 18:24:09,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 18:24:09,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 18:24:09,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 18:24:09,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 18:24:09,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 18:24:09,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 18:24:09,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 18:24:09,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 18:24:09,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 18:24:09,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 18:24:09,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 18:24:09,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 18:24:09,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 18:24:09,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 18:24:09,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 18:24:09,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 18:24:09,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 18:24:09,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 18:24:09,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 18:24:09,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 18:24:09,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 18:24:09,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 18:24:09,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 18:24:09,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 18:24:09,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 18:24:09,206 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 18:24:09,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 18:24:09,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 18:24:09,224 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 18:24:09,224 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 18:24:09,224 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 18:24:09,224 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 18:24:09,224 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 18:24:09,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 18:24:09,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 18:24:09,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 18:24:09,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 18:24:09,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 18:24:09,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 18:24:09,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 18:24:09,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 18:24:09,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 18:24:09,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:24:09,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 18:24:09,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 18:24:09,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 18:24:09,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 18:24:09,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 18:24:09,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 18:24:09,230 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 -> d09e5902c3e47c1de0260aa103bb8e06a6e05e27 [2018-12-31 18:24:09,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 18:24:09,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 18:24:09,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 18:24:09,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 18:24:09,326 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 18:24:09,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-31 18:24:09,400 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868da527e/236e6c0672c94f179b12ce27dfaa8a70/FLAG3d95c4e24 [2018-12-31 18:24:10,037 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 18:24:10,037 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/mix009_rmo.oepc_false-unreach-call.i [2018-12-31 18:24:10,061 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868da527e/236e6c0672c94f179b12ce27dfaa8a70/FLAG3d95c4e24 [2018-12-31 18:24:10,245 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/868da527e/236e6c0672c94f179b12ce27dfaa8a70 [2018-12-31 18:24:10,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 18:24:10,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 18:24:10,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 18:24:10,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 18:24:10,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 18:24:10,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:24:10" (1/1) ... [2018-12-31 18:24:10,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556facdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:10, skipping insertion in model container [2018-12-31 18:24:10,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 06:24:10" (1/1) ... [2018-12-31 18:24:10,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 18:24:10,347 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 18:24:10,910 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:24:10,931 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 18:24:11,136 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 18:24:11,252 INFO L195 MainTranslator]: Completed translation [2018-12-31 18:24:11,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11 WrapperNode [2018-12-31 18:24:11,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 18:24:11,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 18:24:11,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 18:24:11,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 18:24:11,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 18:24:11,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 18:24:11,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 18:24:11,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 18:24:11,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... [2018-12-31 18:24:11,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 18:24:11,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 18:24:11,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 18:24:11,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 18:24:11,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 18:24:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 18:24:11,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-31 18:24:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 18:24:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 18:24:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-31 18:24:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-31 18:24:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-31 18:24:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-31 18:24:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-31 18:24:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 18:24:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 18:24:11,452 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 18:24:12,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 18:24:12,641 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 18:24:12,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:24:12 BoogieIcfgContainer [2018-12-31 18:24:12,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 18:24:12,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 18:24:12,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 18:24:12,647 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 18:24:12,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 06:24:10" (1/3) ... [2018-12-31 18:24:12,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33df9328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:24:12, skipping insertion in model container [2018-12-31 18:24:12,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 06:24:11" (2/3) ... [2018-12-31 18:24:12,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33df9328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 06:24:12, skipping insertion in model container [2018-12-31 18:24:12,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:24:12" (3/3) ... [2018-12-31 18:24:12,651 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_rmo.oepc_false-unreach-call.i [2018-12-31 18:24:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,700 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,700 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,701 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,702 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,702 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,703 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,704 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,705 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,706 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,707 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,708 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,709 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,731 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,732 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,733 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,734 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,735 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,736 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,737 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,738 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 18:24:12,776 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 18:24:12,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 18:24:12,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 18:24:12,807 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 18:24:12,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 18:24:12,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 18:24:12,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 18:24:12,839 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 18:24:12,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 18:24:12,839 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 18:24:12,839 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 18:24:12,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 18:24:12,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 18:24:12,854 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-31 18:24:15,397 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-31 18:24:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-31 18:24:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 18:24:15,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:15,410 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] [2018-12-31 18:24:15,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-31 18:24:15,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:15,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:15,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:15,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:15,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:15,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:15,903 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-31 18:24:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:17,429 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-31 18:24:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:17,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 18:24:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:17,801 INFO L225 Difference]: With dead ends: 60793 [2018-12-31 18:24:17,801 INFO L226 Difference]: Without dead ends: 44273 [2018-12-31 18:24:17,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-31 18:24:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-31 18:24:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-31 18:24:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-31 18:24:19,666 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-31 18:24:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:19,667 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-31 18:24:19,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-31 18:24:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-31 18:24:19,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:19,679 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] [2018-12-31 18:24:19,679 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:19,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:19,681 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-31 18:24:19,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:19,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:19,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:19,923 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 5 states. [2018-12-31 18:24:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:23,966 INFO L93 Difference]: Finished difference Result 64007 states and 235337 transitions. [2018-12-31 18:24:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:24:23,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-31 18:24:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:24,534 INFO L225 Difference]: With dead ends: 64007 [2018-12-31 18:24:24,534 INFO L226 Difference]: Without dead ends: 63455 [2018-12-31 18:24:24,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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 18:24:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63455 states. [2018-12-31 18:24:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63455 to 41423. [2018-12-31 18:24:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41423 states. [2018-12-31 18:24:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41423 states to 41423 states and 152332 transitions. [2018-12-31 18:24:26,567 INFO L78 Accepts]: Start accepts. Automaton has 41423 states and 152332 transitions. Word has length 48 [2018-12-31 18:24:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 41423 states and 152332 transitions. [2018-12-31 18:24:26,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41423 states and 152332 transitions. [2018-12-31 18:24:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 18:24:26,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:26,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:26,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:26,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-31 18:24:26,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:26,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:26,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:26,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:26,741 INFO L87 Difference]: Start difference. First operand 41423 states and 152332 transitions. Second operand 6 states. [2018-12-31 18:24:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:28,404 INFO L93 Difference]: Finished difference Result 52773 states and 191027 transitions. [2018-12-31 18:24:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:28,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-12-31 18:24:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:28,535 INFO L225 Difference]: With dead ends: 52773 [2018-12-31 18:24:28,535 INFO L226 Difference]: Without dead ends: 52261 [2018-12-31 18:24:28,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52261 states. [2018-12-31 18:24:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52261 to 45377. [2018-12-31 18:24:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45377 states. [2018-12-31 18:24:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45377 states to 45377 states and 166020 transitions. [2018-12-31 18:24:29,758 INFO L78 Accepts]: Start accepts. Automaton has 45377 states and 166020 transitions. Word has length 49 [2018-12-31 18:24:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:29,759 INFO L480 AbstractCegarLoop]: Abstraction has 45377 states and 166020 transitions. [2018-12-31 18:24:29,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 45377 states and 166020 transitions. [2018-12-31 18:24:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 18:24:30,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:30,577 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] [2018-12-31 18:24:30,578 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-31 18:24:30,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:30,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:30,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:30,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:30,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:30,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:30,704 INFO L87 Difference]: Start difference. First operand 45377 states and 166020 transitions. Second operand 3 states. [2018-12-31 18:24:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:31,207 INFO L93 Difference]: Finished difference Result 65253 states and 235816 transitions. [2018-12-31 18:24:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:31,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 18:24:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:31,387 INFO L225 Difference]: With dead ends: 65253 [2018-12-31 18:24:31,387 INFO L226 Difference]: Without dead ends: 65253 [2018-12-31 18:24:31,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2018-12-31 18:24:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 50947. [2018-12-31 18:24:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50947 states. [2018-12-31 18:24:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50947 states to 50947 states and 184327 transitions. [2018-12-31 18:24:32,679 INFO L78 Accepts]: Start accepts. Automaton has 50947 states and 184327 transitions. Word has length 51 [2018-12-31 18:24:32,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:32,679 INFO L480 AbstractCegarLoop]: Abstraction has 50947 states and 184327 transitions. [2018-12-31 18:24:32,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50947 states and 184327 transitions. [2018-12-31 18:24:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:32,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:32,699 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] [2018-12-31 18:24:32,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1723497845, now seen corresponding path program 1 times [2018-12-31 18:24:32,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:32,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:32,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:32,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:32,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:32,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:32,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:32,921 INFO L87 Difference]: Start difference. First operand 50947 states and 184327 transitions. Second operand 7 states. [2018-12-31 18:24:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:35,789 INFO L93 Difference]: Finished difference Result 83876 states and 290140 transitions. [2018-12-31 18:24:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 18:24:35,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-31 18:24:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:36,020 INFO L225 Difference]: With dead ends: 83876 [2018-12-31 18:24:36,020 INFO L226 Difference]: Without dead ends: 83876 [2018-12-31 18:24:36,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:24:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83876 states. [2018-12-31 18:24:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83876 to 66523. [2018-12-31 18:24:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66523 states. [2018-12-31 18:24:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66523 states to 66523 states and 234927 transitions. [2018-12-31 18:24:37,529 INFO L78 Accepts]: Start accepts. Automaton has 66523 states and 234927 transitions. Word has length 55 [2018-12-31 18:24:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:37,530 INFO L480 AbstractCegarLoop]: Abstraction has 66523 states and 234927 transitions. [2018-12-31 18:24:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 66523 states and 234927 transitions. [2018-12-31 18:24:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:37,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:37,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:37,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash -835994164, now seen corresponding path program 1 times [2018-12-31 18:24:37,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:37,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:37,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:37,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:37,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:37,721 INFO L87 Difference]: Start difference. First operand 66523 states and 234927 transitions. Second operand 4 states. [2018-12-31 18:24:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:37,891 INFO L93 Difference]: Finished difference Result 14673 states and 46636 transitions. [2018-12-31 18:24:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:24:37,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-31 18:24:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:37,916 INFO L225 Difference]: With dead ends: 14673 [2018-12-31 18:24:37,917 INFO L226 Difference]: Without dead ends: 13087 [2018-12-31 18:24:37,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:24:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13087 states. [2018-12-31 18:24:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13087 to 13038. [2018-12-31 18:24:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2018-12-31 18:24:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41162 transitions. [2018-12-31 18:24:38,098 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41162 transitions. Word has length 55 [2018-12-31 18:24:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:38,099 INFO L480 AbstractCegarLoop]: Abstraction has 13038 states and 41162 transitions. [2018-12-31 18:24:38,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41162 transitions. [2018-12-31 18:24:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 18:24:38,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:38,101 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] [2018-12-31 18:24:38,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-31 18:24:38,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:38,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:38,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:38,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:38,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:38,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:38,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:38,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:38,340 INFO L87 Difference]: Start difference. First operand 13038 states and 41162 transitions. Second operand 6 states. [2018-12-31 18:24:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:39,056 INFO L93 Difference]: Finished difference Result 19060 states and 59763 transitions. [2018-12-31 18:24:39,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:24:39,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-31 18:24:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:39,094 INFO L225 Difference]: With dead ends: 19060 [2018-12-31 18:24:39,094 INFO L226 Difference]: Without dead ends: 18988 [2018-12-31 18:24:39,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:24:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2018-12-31 18:24:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 13596. [2018-12-31 18:24:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13596 states. [2018-12-31 18:24:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 42815 transitions. [2018-12-31 18:24:39,346 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 42815 transitions. Word has length 55 [2018-12-31 18:24:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:39,346 INFO L480 AbstractCegarLoop]: Abstraction has 13596 states and 42815 transitions. [2018-12-31 18:24:39,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 42815 transitions. [2018-12-31 18:24:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:24:39,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:39,351 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] [2018-12-31 18:24:39,352 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-31 18:24:39,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:39,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:39,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:39,452 INFO L87 Difference]: Start difference. First operand 13596 states and 42815 transitions. Second operand 4 states. [2018-12-31 18:24:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:39,621 INFO L93 Difference]: Finished difference Result 15779 states and 49765 transitions. [2018-12-31 18:24:39,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 18:24:39,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-31 18:24:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:39,652 INFO L225 Difference]: With dead ends: 15779 [2018-12-31 18:24:39,653 INFO L226 Difference]: Without dead ends: 15779 [2018-12-31 18:24:39,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2018-12-31 18:24:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 14376. [2018-12-31 18:24:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14376 states. [2018-12-31 18:24:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 45279 transitions. [2018-12-31 18:24:39,894 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 45279 transitions. Word has length 63 [2018-12-31 18:24:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:39,895 INFO L480 AbstractCegarLoop]: Abstraction has 14376 states and 45279 transitions. [2018-12-31 18:24:39,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 45279 transitions. [2018-12-31 18:24:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 18:24:39,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:39,900 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] [2018-12-31 18:24:39,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-31 18:24:39,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:40,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:40,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:24:40,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:24:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:24:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:24:40,339 INFO L87 Difference]: Start difference. First operand 14376 states and 45279 transitions. Second operand 8 states. [2018-12-31 18:24:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:41,465 INFO L93 Difference]: Finished difference Result 19042 states and 58902 transitions. [2018-12-31 18:24:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:41,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-31 18:24:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:41,502 INFO L225 Difference]: With dead ends: 19042 [2018-12-31 18:24:41,503 INFO L226 Difference]: Without dead ends: 18971 [2018-12-31 18:24:41,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:24:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2018-12-31 18:24:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 16646. [2018-12-31 18:24:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16646 states. [2018-12-31 18:24:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16646 states to 16646 states and 51931 transitions. [2018-12-31 18:24:41,775 INFO L78 Accepts]: Start accepts. Automaton has 16646 states and 51931 transitions. Word has length 63 [2018-12-31 18:24:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:41,776 INFO L480 AbstractCegarLoop]: Abstraction has 16646 states and 51931 transitions. [2018-12-31 18:24:41,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:24:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 16646 states and 51931 transitions. [2018-12-31 18:24:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:24:41,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:41,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] [2018-12-31 18:24:41,785 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-12-31 18:24:41,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:42,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:42,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:42,032 INFO L87 Difference]: Start difference. First operand 16646 states and 51931 transitions. Second operand 4 states. [2018-12-31 18:24:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:42,479 INFO L93 Difference]: Finished difference Result 20582 states and 63398 transitions. [2018-12-31 18:24:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:42,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-31 18:24:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:42,518 INFO L225 Difference]: With dead ends: 20582 [2018-12-31 18:24:42,518 INFO L226 Difference]: Without dead ends: 20582 [2018-12-31 18:24:42,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20582 states. [2018-12-31 18:24:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20582 to 18532. [2018-12-31 18:24:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18532 states. [2018-12-31 18:24:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18532 states to 18532 states and 57288 transitions. [2018-12-31 18:24:42,823 INFO L78 Accepts]: Start accepts. Automaton has 18532 states and 57288 transitions. Word has length 67 [2018-12-31 18:24:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:42,824 INFO L480 AbstractCegarLoop]: Abstraction has 18532 states and 57288 transitions. [2018-12-31 18:24:42,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 18532 states and 57288 transitions. [2018-12-31 18:24:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-31 18:24:42,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:42,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:42,834 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:42,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:42,835 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-12-31 18:24:42,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:42,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:42,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:42,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:42,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:42,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:42,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:42,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:42,950 INFO L87 Difference]: Start difference. First operand 18532 states and 57288 transitions. Second operand 3 states. [2018-12-31 18:24:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:43,503 INFO L93 Difference]: Finished difference Result 19140 states and 58939 transitions. [2018-12-31 18:24:43,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:43,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-31 18:24:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:43,539 INFO L225 Difference]: With dead ends: 19140 [2018-12-31 18:24:43,539 INFO L226 Difference]: Without dead ends: 19140 [2018-12-31 18:24:43,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19140 states. [2018-12-31 18:24:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19140 to 18856. [2018-12-31 18:24:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2018-12-31 18:24:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 58160 transitions. [2018-12-31 18:24:43,833 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 58160 transitions. Word has length 67 [2018-12-31 18:24:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:43,833 INFO L480 AbstractCegarLoop]: Abstraction has 18856 states and 58160 transitions. [2018-12-31 18:24:43,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 58160 transitions. [2018-12-31 18:24:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:43,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:43,846 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] [2018-12-31 18:24:43,846 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-12-31 18:24:43,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:43,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:43,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:43,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:43,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:43,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:43,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:43,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:43,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:43,975 INFO L87 Difference]: Start difference. First operand 18856 states and 58160 transitions. Second operand 3 states. [2018-12-31 18:24:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:44,204 INFO L93 Difference]: Finished difference Result 24076 states and 74215 transitions. [2018-12-31 18:24:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:44,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:24:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:44,251 INFO L225 Difference]: With dead ends: 24076 [2018-12-31 18:24:44,251 INFO L226 Difference]: Without dead ends: 24076 [2018-12-31 18:24:44,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2018-12-31 18:24:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 23284. [2018-12-31 18:24:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23284 states. [2018-12-31 18:24:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 71849 transitions. [2018-12-31 18:24:44,623 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 71849 transitions. Word has length 69 [2018-12-31 18:24:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 23284 states and 71849 transitions. [2018-12-31 18:24:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 71849 transitions. [2018-12-31 18:24:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:44,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:44,638 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] [2018-12-31 18:24:44,638 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-12-31 18:24:44,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:45,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:45,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:45,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:45,202 INFO L87 Difference]: Start difference. First operand 23284 states and 71849 transitions. Second operand 6 states. [2018-12-31 18:24:45,567 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:24:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:46,933 INFO L93 Difference]: Finished difference Result 27964 states and 85091 transitions. [2018-12-31 18:24:46,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:46,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:24:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:46,996 INFO L225 Difference]: With dead ends: 27964 [2018-12-31 18:24:46,996 INFO L226 Difference]: Without dead ends: 27964 [2018-12-31 18:24:46,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27964 states. [2018-12-31 18:24:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27964 to 26476. [2018-12-31 18:24:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26476 states. [2018-12-31 18:24:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26476 states to 26476 states and 81094 transitions. [2018-12-31 18:24:47,601 INFO L78 Accepts]: Start accepts. Automaton has 26476 states and 81094 transitions. Word has length 69 [2018-12-31 18:24:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:47,602 INFO L480 AbstractCegarLoop]: Abstraction has 26476 states and 81094 transitions. [2018-12-31 18:24:47,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26476 states and 81094 transitions. [2018-12-31 18:24:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:47,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:47,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:47,617 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-12-31 18:24:47,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:47,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:47,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:47,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:47,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:47,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:24:47,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:24:47,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:24:47,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:24:47,972 INFO L87 Difference]: Start difference. First operand 26476 states and 81094 transitions. Second operand 6 states. [2018-12-31 18:24:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:48,743 INFO L93 Difference]: Finished difference Result 30144 states and 89716 transitions. [2018-12-31 18:24:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:48,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-31 18:24:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:48,800 INFO L225 Difference]: With dead ends: 30144 [2018-12-31 18:24:48,800 INFO L226 Difference]: Without dead ends: 30144 [2018-12-31 18:24:48,800 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 18:24:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30144 states. [2018-12-31 18:24:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30144 to 26872. [2018-12-31 18:24:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26872 states. [2018-12-31 18:24:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26872 states to 26872 states and 81197 transitions. [2018-12-31 18:24:49,245 INFO L78 Accepts]: Start accepts. Automaton has 26872 states and 81197 transitions. Word has length 69 [2018-12-31 18:24:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 26872 states and 81197 transitions. [2018-12-31 18:24:49,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:24:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26872 states and 81197 transitions. [2018-12-31 18:24:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:49,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:49,262 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] [2018-12-31 18:24:49,263 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:49,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-12-31 18:24:49,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:49,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:49,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:49,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:49,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:49,405 INFO L87 Difference]: Start difference. First operand 26872 states and 81197 transitions. Second operand 5 states. [2018-12-31 18:24:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:49,904 INFO L93 Difference]: Finished difference Result 32055 states and 96368 transitions. [2018-12-31 18:24:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:49,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:24:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:49,967 INFO L225 Difference]: With dead ends: 32055 [2018-12-31 18:24:49,967 INFO L226 Difference]: Without dead ends: 32055 [2018-12-31 18:24:49,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32055 states. [2018-12-31 18:24:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32055 to 29288. [2018-12-31 18:24:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-31 18:24:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87955 transitions. [2018-12-31 18:24:50,426 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87955 transitions. Word has length 69 [2018-12-31 18:24:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:50,426 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87955 transitions. [2018-12-31 18:24:50,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87955 transitions. [2018-12-31 18:24:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:50,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:50,441 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] [2018-12-31 18:24:50,441 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:50,442 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-12-31 18:24:50,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:50,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:50,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:50,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:50,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:50,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:50,514 INFO L87 Difference]: Start difference. First operand 29288 states and 87955 transitions. Second operand 3 states. [2018-12-31 18:24:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:50,876 INFO L93 Difference]: Finished difference Result 41748 states and 124592 transitions. [2018-12-31 18:24:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:50,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:24:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:50,955 INFO L225 Difference]: With dead ends: 41748 [2018-12-31 18:24:50,955 INFO L226 Difference]: Without dead ends: 41748 [2018-12-31 18:24:50,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41748 states. [2018-12-31 18:24:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41748 to 31196. [2018-12-31 18:24:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31196 states. [2018-12-31 18:24:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 94070 transitions. [2018-12-31 18:24:51,469 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 94070 transitions. Word has length 69 [2018-12-31 18:24:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:51,469 INFO L480 AbstractCegarLoop]: Abstraction has 31196 states and 94070 transitions. [2018-12-31 18:24:51,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 94070 transitions. [2018-12-31 18:24:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:51,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:51,481 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] [2018-12-31 18:24:51,481 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-31 18:24:51,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:51,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:51,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:51,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:51,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:51,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:51,685 INFO L87 Difference]: Start difference. First operand 31196 states and 94070 transitions. Second operand 5 states. [2018-12-31 18:24:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:51,740 INFO L93 Difference]: Finished difference Result 7936 states and 19189 transitions. [2018-12-31 18:24:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 18:24:51,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-31 18:24:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:51,752 INFO L225 Difference]: With dead ends: 7936 [2018-12-31 18:24:51,753 INFO L226 Difference]: Without dead ends: 6454 [2018-12-31 18:24:51,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6454 states. [2018-12-31 18:24:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6454 to 5802. [2018-12-31 18:24:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5802 states. [2018-12-31 18:24:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5802 states to 5802 states and 13607 transitions. [2018-12-31 18:24:51,826 INFO L78 Accepts]: Start accepts. Automaton has 5802 states and 13607 transitions. Word has length 69 [2018-12-31 18:24:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 5802 states and 13607 transitions. [2018-12-31 18:24:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5802 states and 13607 transitions. [2018-12-31 18:24:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 18:24:51,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:51,834 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] [2018-12-31 18:24:51,834 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-31 18:24:51,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:51,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:51,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:51,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:51,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 18:24:51,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 18:24:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 18:24:51,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:51,912 INFO L87 Difference]: Start difference. First operand 5802 states and 13607 transitions. Second operand 3 states. [2018-12-31 18:24:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:52,157 INFO L93 Difference]: Finished difference Result 7700 states and 17933 transitions. [2018-12-31 18:24:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 18:24:52,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-31 18:24:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:52,171 INFO L225 Difference]: With dead ends: 7700 [2018-12-31 18:24:52,172 INFO L226 Difference]: Without dead ends: 7700 [2018-12-31 18:24:52,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 18:24:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2018-12-31 18:24:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 5741. [2018-12-31 18:24:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5741 states. [2018-12-31 18:24:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 13147 transitions. [2018-12-31 18:24:52,273 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 13147 transitions. Word has length 69 [2018-12-31 18:24:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:52,274 INFO L480 AbstractCegarLoop]: Abstraction has 5741 states and 13147 transitions. [2018-12-31 18:24:52,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 18:24:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 13147 transitions. [2018-12-31 18:24:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:24:52,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:52,284 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] [2018-12-31 18:24:52,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-31 18:24:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:52,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:52,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:52,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:52,403 INFO L87 Difference]: Start difference. First operand 5741 states and 13147 transitions. Second operand 5 states. [2018-12-31 18:24:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:52,600 INFO L93 Difference]: Finished difference Result 6905 states and 15771 transitions. [2018-12-31 18:24:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:52,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-31 18:24:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:52,611 INFO L225 Difference]: With dead ends: 6905 [2018-12-31 18:24:52,611 INFO L226 Difference]: Without dead ends: 6905 [2018-12-31 18:24:52,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2018-12-31 18:24:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6185. [2018-12-31 18:24:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2018-12-31 18:24:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 14151 transitions. [2018-12-31 18:24:52,734 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 14151 transitions. Word has length 75 [2018-12-31 18:24:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:52,734 INFO L480 AbstractCegarLoop]: Abstraction has 6185 states and 14151 transitions. [2018-12-31 18:24:52,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 14151 transitions. [2018-12-31 18:24:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 18:24:52,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:52,741 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] [2018-12-31 18:24:52,742 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-31 18:24:52,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:52,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:52,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:52,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:53,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:53,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:53,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:53,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:53,232 INFO L87 Difference]: Start difference. First operand 6185 states and 14151 transitions. Second operand 7 states. [2018-12-31 18:24:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:53,853 INFO L93 Difference]: Finished difference Result 7563 states and 17122 transitions. [2018-12-31 18:24:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 18:24:53,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-31 18:24:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:53,867 INFO L225 Difference]: With dead ends: 7563 [2018-12-31 18:24:53,867 INFO L226 Difference]: Without dead ends: 7444 [2018-12-31 18:24:53,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-31 18:24:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7444 states. [2018-12-31 18:24:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7444 to 6282. [2018-12-31 18:24:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6282 states. [2018-12-31 18:24:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 14244 transitions. [2018-12-31 18:24:53,948 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 14244 transitions. Word has length 75 [2018-12-31 18:24:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:53,948 INFO L480 AbstractCegarLoop]: Abstraction has 6282 states and 14244 transitions. [2018-12-31 18:24:53,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 14244 transitions. [2018-12-31 18:24:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:24:53,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:53,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:53,957 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1874738626, now seen corresponding path program 1 times [2018-12-31 18:24:53,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:53,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:54,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:54,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:54,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:54,169 INFO L87 Difference]: Start difference. First operand 6282 states and 14244 transitions. Second operand 4 states. [2018-12-31 18:24:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:54,549 INFO L93 Difference]: Finished difference Result 10017 states and 22619 transitions. [2018-12-31 18:24:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:54,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:24:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:54,564 INFO L225 Difference]: With dead ends: 10017 [2018-12-31 18:24:54,564 INFO L226 Difference]: Without dead ends: 10017 [2018-12-31 18:24:54,564 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 18:24:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2018-12-31 18:24:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 7402. [2018-12-31 18:24:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7402 states. [2018-12-31 18:24:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7402 states to 7402 states and 16578 transitions. [2018-12-31 18:24:54,662 INFO L78 Accepts]: Start accepts. Automaton has 7402 states and 16578 transitions. Word has length 94 [2018-12-31 18:24:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:54,662 INFO L480 AbstractCegarLoop]: Abstraction has 7402 states and 16578 transitions. [2018-12-31 18:24:54,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7402 states and 16578 transitions. [2018-12-31 18:24:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:24:54,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:54,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:54,673 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1056030846, now seen corresponding path program 2 times [2018-12-31 18:24:54,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:54,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:54,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:54,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:54,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:54,889 INFO L87 Difference]: Start difference. First operand 7402 states and 16578 transitions. Second operand 4 states. [2018-12-31 18:24:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:56,912 INFO L93 Difference]: Finished difference Result 10390 states and 22984 transitions. [2018-12-31 18:24:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:56,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:24:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:56,928 INFO L225 Difference]: With dead ends: 10390 [2018-12-31 18:24:56,929 INFO L226 Difference]: Without dead ends: 10390 [2018-12-31 18:24:56,929 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 18:24:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2018-12-31 18:24:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 8515. [2018-12-31 18:24:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2018-12-31 18:24:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 19095 transitions. [2018-12-31 18:24:57,060 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 19095 transitions. Word has length 94 [2018-12-31 18:24:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:57,061 INFO L480 AbstractCegarLoop]: Abstraction has 8515 states and 19095 transitions. [2018-12-31 18:24:57,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 19095 transitions. [2018-12-31 18:24:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 18:24:57,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:57,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:57,073 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -653933925, now seen corresponding path program 1 times [2018-12-31 18:24:57,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:57,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:24:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 18:24:57,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 18:24:57,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 18:24:57,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 18:24:57,256 INFO L87 Difference]: Start difference. First operand 8515 states and 19095 transitions. Second operand 4 states. [2018-12-31 18:24:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:57,376 INFO L93 Difference]: Finished difference Result 8204 states and 18457 transitions. [2018-12-31 18:24:57,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 18:24:57,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 18:24:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:57,387 INFO L225 Difference]: With dead ends: 8204 [2018-12-31 18:24:57,387 INFO L226 Difference]: Without dead ends: 8204 [2018-12-31 18:24:57,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2018-12-31 18:24:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7608. [2018-12-31 18:24:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7608 states. [2018-12-31 18:24:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7608 states to 7608 states and 17194 transitions. [2018-12-31 18:24:57,482 INFO L78 Accepts]: Start accepts. Automaton has 7608 states and 17194 transitions. Word has length 94 [2018-12-31 18:24:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:57,482 INFO L480 AbstractCegarLoop]: Abstraction has 7608 states and 17194 transitions. [2018-12-31 18:24:57,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 18:24:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 7608 states and 17194 transitions. [2018-12-31 18:24:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:57,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:57,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:57,491 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1777281593, now seen corresponding path program 1 times [2018-12-31 18:24:57,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:57,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:57,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:57,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:57,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:24:57,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:24:57,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:24:57,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:57,685 INFO L87 Difference]: Start difference. First operand 7608 states and 17194 transitions. Second operand 7 states. [2018-12-31 18:24:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:58,367 INFO L93 Difference]: Finished difference Result 9491 states and 21419 transitions. [2018-12-31 18:24:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:58,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-31 18:24:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:58,381 INFO L225 Difference]: With dead ends: 9491 [2018-12-31 18:24:58,381 INFO L226 Difference]: Without dead ends: 9491 [2018-12-31 18:24:58,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9491 states. [2018-12-31 18:24:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9491 to 7697. [2018-12-31 18:24:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7697 states. [2018-12-31 18:24:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7697 states to 7697 states and 17465 transitions. [2018-12-31 18:24:58,483 INFO L78 Accepts]: Start accepts. Automaton has 7697 states and 17465 transitions. Word has length 96 [2018-12-31 18:24:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:58,483 INFO L480 AbstractCegarLoop]: Abstraction has 7697 states and 17465 transitions. [2018-12-31 18:24:58,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:24:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 17465 transitions. [2018-12-31 18:24:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:58,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:58,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:58,493 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1611485258, now seen corresponding path program 1 times [2018-12-31 18:24:58,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:58,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:58,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:58,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:58,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:58,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:58,641 INFO L87 Difference]: Start difference. First operand 7697 states and 17465 transitions. Second operand 5 states. [2018-12-31 18:24:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:58,766 INFO L93 Difference]: Finished difference Result 8560 states and 19324 transitions. [2018-12-31 18:24:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:24:58,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:24:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:58,778 INFO L225 Difference]: With dead ends: 8560 [2018-12-31 18:24:58,778 INFO L226 Difference]: Without dead ends: 8560 [2018-12-31 18:24:58,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:24:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2018-12-31 18:24:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 6593. [2018-12-31 18:24:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6593 states. [2018-12-31 18:24:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 14984 transitions. [2018-12-31 18:24:58,867 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 14984 transitions. Word has length 96 [2018-12-31 18:24:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:58,868 INFO L480 AbstractCegarLoop]: Abstraction has 6593 states and 14984 transitions. [2018-12-31 18:24:58,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 14984 transitions. [2018-12-31 18:24:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:58,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:58,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:58,876 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:58,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1356748713, now seen corresponding path program 1 times [2018-12-31 18:24:58,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:58,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:58,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:58,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:58,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:24:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:24:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:24:59,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 18:24:59,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 18:24:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 18:24:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 18:24:59,019 INFO L87 Difference]: Start difference. First operand 6593 states and 14984 transitions. Second operand 5 states. [2018-12-31 18:24:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:24:59,593 INFO L93 Difference]: Finished difference Result 10094 states and 22980 transitions. [2018-12-31 18:24:59,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 18:24:59,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-31 18:24:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:24:59,608 INFO L225 Difference]: With dead ends: 10094 [2018-12-31 18:24:59,608 INFO L226 Difference]: Without dead ends: 10016 [2018-12-31 18:24:59,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:24:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10016 states. [2018-12-31 18:24:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10016 to 7487. [2018-12-31 18:24:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7487 states. [2018-12-31 18:24:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7487 states to 7487 states and 17008 transitions. [2018-12-31 18:24:59,710 INFO L78 Accepts]: Start accepts. Automaton has 7487 states and 17008 transitions. Word has length 96 [2018-12-31 18:24:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:24:59,710 INFO L480 AbstractCegarLoop]: Abstraction has 7487 states and 17008 transitions. [2018-12-31 18:24:59,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 18:24:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7487 states and 17008 transitions. [2018-12-31 18:24:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:24:59,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:24:59,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:24:59,719 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:24:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:24:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1693454102, now seen corresponding path program 1 times [2018-12-31 18:24:59,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:24:59,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:24:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:59,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:24:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:24:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:00,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:00,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:00,247 INFO L87 Difference]: Start difference. First operand 7487 states and 17008 transitions. Second operand 6 states. [2018-12-31 18:25:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:01,059 INFO L93 Difference]: Finished difference Result 9453 states and 21289 transitions. [2018-12-31 18:25:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 18:25:01,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:25:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:01,072 INFO L225 Difference]: With dead ends: 9453 [2018-12-31 18:25:01,073 INFO L226 Difference]: Without dead ends: 9365 [2018-12-31 18:25:01,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 18:25:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9365 states. [2018-12-31 18:25:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9365 to 7032. [2018-12-31 18:25:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7032 states. [2018-12-31 18:25:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7032 states to 7032 states and 16004 transitions. [2018-12-31 18:25:01,172 INFO L78 Accepts]: Start accepts. Automaton has 7032 states and 16004 transitions. Word has length 96 [2018-12-31 18:25:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:01,172 INFO L480 AbstractCegarLoop]: Abstraction has 7032 states and 16004 transitions. [2018-12-31 18:25:01,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7032 states and 16004 transitions. [2018-12-31 18:25:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:01,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:01,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:01,181 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -564113265, now seen corresponding path program 1 times [2018-12-31 18:25:01,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:01,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:01,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:01,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:25:01,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:25:01,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:25:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:01,953 INFO L87 Difference]: Start difference. First operand 7032 states and 16004 transitions. Second operand 8 states. [2018-12-31 18:25:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:02,517 INFO L93 Difference]: Finished difference Result 10295 states and 23705 transitions. [2018-12-31 18:25:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:25:02,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-31 18:25:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:02,531 INFO L225 Difference]: With dead ends: 10295 [2018-12-31 18:25:02,532 INFO L226 Difference]: Without dead ends: 10295 [2018-12-31 18:25:02,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:25:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10295 states. [2018-12-31 18:25:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10295 to 7469. [2018-12-31 18:25:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-31 18:25:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 17150 transitions. [2018-12-31 18:25:02,641 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 17150 transitions. Word has length 96 [2018-12-31 18:25:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:02,642 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 17150 transitions. [2018-12-31 18:25:02,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:25:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 17150 transitions. [2018-12-31 18:25:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:02,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:02,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:02,650 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash 323390416, now seen corresponding path program 1 times [2018-12-31 18:25:02,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:03,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:03,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 18:25:03,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 18:25:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 18:25:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-31 18:25:03,283 INFO L87 Difference]: Start difference. First operand 7469 states and 17150 transitions. Second operand 10 states. [2018-12-31 18:25:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:04,187 INFO L93 Difference]: Finished difference Result 11592 states and 26583 transitions. [2018-12-31 18:25:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:25:04,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-31 18:25:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:04,203 INFO L225 Difference]: With dead ends: 11592 [2018-12-31 18:25:04,204 INFO L226 Difference]: Without dead ends: 11592 [2018-12-31 18:25:04,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2018-12-31 18:25:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2018-12-31 18:25:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 9095. [2018-12-31 18:25:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9095 states. [2018-12-31 18:25:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 20675 transitions. [2018-12-31 18:25:04,318 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 20675 transitions. Word has length 96 [2018-12-31 18:25:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:04,318 INFO L480 AbstractCegarLoop]: Abstraction has 9095 states and 20675 transitions. [2018-12-31 18:25:04,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 18:25:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 20675 transitions. [2018-12-31 18:25:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-31 18:25:04,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:04,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:04,328 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1408585136, now seen corresponding path program 1 times [2018-12-31 18:25:04,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:04,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:04,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:04,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:04,932 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9 [2018-12-31 18:25:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:04,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:04,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:04,947 INFO L87 Difference]: Start difference. First operand 9095 states and 20675 transitions. Second operand 6 states. [2018-12-31 18:25:05,266 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 18:25:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:05,720 INFO L93 Difference]: Finished difference Result 8775 states and 19683 transitions. [2018-12-31 18:25:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:05,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-31 18:25:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:05,733 INFO L225 Difference]: With dead ends: 8775 [2018-12-31 18:25:05,733 INFO L226 Difference]: Without dead ends: 8775 [2018-12-31 18:25:05,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8775 states. [2018-12-31 18:25:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8775 to 7134. [2018-12-31 18:25:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-12-31 18:25:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 16071 transitions. [2018-12-31 18:25:05,830 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 16071 transitions. Word has length 96 [2018-12-31 18:25:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:05,830 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 16071 transitions. [2018-12-31 18:25:05,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 16071 transitions. [2018-12-31 18:25:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:05,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:05,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:05,839 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2018-12-31 18:25:05,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:05,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:05,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:05,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:06,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:06,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 18:25:06,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 18:25:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 18:25:06,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:25:06,085 INFO L87 Difference]: Start difference. First operand 7134 states and 16071 transitions. Second operand 13 states. [2018-12-31 18:25:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:07,309 INFO L93 Difference]: Finished difference Result 9861 states and 21847 transitions. [2018-12-31 18:25:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-31 18:25:07,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-12-31 18:25:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:07,323 INFO L225 Difference]: With dead ends: 9861 [2018-12-31 18:25:07,323 INFO L226 Difference]: Without dead ends: 9861 [2018-12-31 18:25:07,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-31 18:25:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2018-12-31 18:25:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 7851. [2018-12-31 18:25:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7851 states. [2018-12-31 18:25:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 17644 transitions. [2018-12-31 18:25:07,440 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 17644 transitions. Word has length 98 [2018-12-31 18:25:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:07,441 INFO L480 AbstractCegarLoop]: Abstraction has 7851 states and 17644 transitions. [2018-12-31 18:25:07,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 18:25:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 17644 transitions. [2018-12-31 18:25:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:07,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:07,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:07,451 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2018-12-31 18:25:07,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:07,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:07,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:07,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:07,667 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 18:25:07,849 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:25:08,027 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 18:25:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:08,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:25:08,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:25:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:25:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:08,450 INFO L87 Difference]: Start difference. First operand 7851 states and 17644 transitions. Second operand 9 states. [2018-12-31 18:25:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:09,462 INFO L93 Difference]: Finished difference Result 12120 states and 27159 transitions. [2018-12-31 18:25:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:25:09,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:25:09,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:09,482 INFO L225 Difference]: With dead ends: 12120 [2018-12-31 18:25:09,482 INFO L226 Difference]: Without dead ends: 8883 [2018-12-31 18:25:09,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-31 18:25:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8883 states. [2018-12-31 18:25:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8883 to 7908. [2018-12-31 18:25:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7908 states. [2018-12-31 18:25:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 17761 transitions. [2018-12-31 18:25:09,605 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 17761 transitions. Word has length 98 [2018-12-31 18:25:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:09,605 INFO L480 AbstractCegarLoop]: Abstraction has 7908 states and 17761 transitions. [2018-12-31 18:25:09,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:25:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 17761 transitions. [2018-12-31 18:25:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:09,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:09,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:09,617 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:09,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1430813447, now seen corresponding path program 1 times [2018-12-31 18:25:09,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:09,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:09,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:09,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:09,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:09,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 18:25:09,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 18:25:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 18:25:09,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 18:25:09,913 INFO L87 Difference]: Start difference. First operand 7908 states and 17761 transitions. Second operand 6 states. [2018-12-31 18:25:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:10,143 INFO L93 Difference]: Finished difference Result 8785 states and 19481 transitions. [2018-12-31 18:25:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 18:25:10,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-31 18:25:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:10,156 INFO L225 Difference]: With dead ends: 8785 [2018-12-31 18:25:10,156 INFO L226 Difference]: Without dead ends: 8735 [2018-12-31 18:25:10,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2018-12-31 18:25:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 7859. [2018-12-31 18:25:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7859 states. [2018-12-31 18:25:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7859 states to 7859 states and 17516 transitions. [2018-12-31 18:25:10,279 INFO L78 Accepts]: Start accepts. Automaton has 7859 states and 17516 transitions. Word has length 98 [2018-12-31 18:25:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:10,280 INFO L480 AbstractCegarLoop]: Abstraction has 7859 states and 17516 transitions. [2018-12-31 18:25:10,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 18:25:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 7859 states and 17516 transitions. [2018-12-31 18:25:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:10,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:10,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:10,293 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:10,293 INFO L82 PathProgramCache]: Analyzing trace with hash 774269081, now seen corresponding path program 2 times [2018-12-31 18:25:10,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:10,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:25:10,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:25:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:25:10,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:10,466 INFO L87 Difference]: Start difference. First operand 7859 states and 17516 transitions. Second operand 7 states. [2018-12-31 18:25:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:10,906 INFO L93 Difference]: Finished difference Result 9487 states and 20865 transitions. [2018-12-31 18:25:10,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 18:25:10,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:25:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:10,921 INFO L225 Difference]: With dead ends: 9487 [2018-12-31 18:25:10,921 INFO L226 Difference]: Without dead ends: 9487 [2018-12-31 18:25:10,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:25:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2018-12-31 18:25:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 7884. [2018-12-31 18:25:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7884 states. [2018-12-31 18:25:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7884 states to 7884 states and 17568 transitions. [2018-12-31 18:25:11,047 INFO L78 Accepts]: Start accepts. Automaton has 7884 states and 17568 transitions. Word has length 98 [2018-12-31 18:25:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:11,048 INFO L480 AbstractCegarLoop]: Abstraction has 7884 states and 17568 transitions. [2018-12-31 18:25:11,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:25:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7884 states and 17568 transitions. [2018-12-31 18:25:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:11,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:11,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:11,059 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1306740200, now seen corresponding path program 2 times [2018-12-31 18:25:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:11,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 18:25:11,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 18:25:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 18:25:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-31 18:25:11,292 INFO L87 Difference]: Start difference. First operand 7884 states and 17568 transitions. Second operand 8 states. [2018-12-31 18:25:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:11,769 INFO L93 Difference]: Finished difference Result 9422 states and 20846 transitions. [2018-12-31 18:25:11,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:25:11,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-31 18:25:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:11,781 INFO L225 Difference]: With dead ends: 9422 [2018-12-31 18:25:11,781 INFO L226 Difference]: Without dead ends: 9422 [2018-12-31 18:25:11,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-31 18:25:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9422 states. [2018-12-31 18:25:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9422 to 8274. [2018-12-31 18:25:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8274 states. [2018-12-31 18:25:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8274 states to 8274 states and 18395 transitions. [2018-12-31 18:25:11,885 INFO L78 Accepts]: Start accepts. Automaton has 8274 states and 18395 transitions. Word has length 98 [2018-12-31 18:25:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:11,885 INFO L480 AbstractCegarLoop]: Abstraction has 8274 states and 18395 transitions. [2018-12-31 18:25:11,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 18:25:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8274 states and 18395 transitions. [2018-12-31 18:25:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:11,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:11,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:11,895 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-12-31 18:25:11,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:11,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:11,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:11,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:12,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:25:12,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:25:12,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:25:12,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:12,148 INFO L87 Difference]: Start difference. First operand 8274 states and 18395 transitions. Second operand 9 states. [2018-12-31 18:25:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:12,359 INFO L93 Difference]: Finished difference Result 11279 states and 25102 transitions. [2018-12-31 18:25:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:25:12,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:25:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:12,369 INFO L225 Difference]: With dead ends: 11279 [2018-12-31 18:25:12,369 INFO L226 Difference]: Without dead ends: 7208 [2018-12-31 18:25:12,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:25:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7208 states. [2018-12-31 18:25:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7208 to 6395. [2018-12-31 18:25:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2018-12-31 18:25:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 14157 transitions. [2018-12-31 18:25:12,445 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 14157 transitions. Word has length 98 [2018-12-31 18:25:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:12,446 INFO L480 AbstractCegarLoop]: Abstraction has 6395 states and 14157 transitions. [2018-12-31 18:25:12,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:25:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 14157 transitions. [2018-12-31 18:25:12,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:12,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:12,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:12,454 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:12,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1919498867, now seen corresponding path program 3 times [2018-12-31 18:25:12,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:12,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:12,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:12,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:12,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:12,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:12,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 18:25:12,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 18:25:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 18:25:12,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 18:25:12,628 INFO L87 Difference]: Start difference. First operand 6395 states and 14157 transitions. Second operand 9 states. [2018-12-31 18:25:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:12,904 INFO L93 Difference]: Finished difference Result 8970 states and 19951 transitions. [2018-12-31 18:25:12,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 18:25:12,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-31 18:25:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:12,915 INFO L225 Difference]: With dead ends: 8970 [2018-12-31 18:25:12,916 INFO L226 Difference]: Without dead ends: 7302 [2018-12-31 18:25:12,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-12-31 18:25:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2018-12-31 18:25:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 6462. [2018-12-31 18:25:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2018-12-31 18:25:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 14296 transitions. [2018-12-31 18:25:12,995 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 14296 transitions. Word has length 98 [2018-12-31 18:25:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:12,995 INFO L480 AbstractCegarLoop]: Abstraction has 6462 states and 14296 transitions. [2018-12-31 18:25:12,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 18:25:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 14296 transitions. [2018-12-31 18:25:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:13,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:13,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:13,004 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 4 times [2018-12-31 18:25:13,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:13,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:13,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:13,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:13,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:13,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-31 18:25:13,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 18:25:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 18:25:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-31 18:25:13,222 INFO L87 Difference]: Start difference. First operand 6462 states and 14296 transitions. Second operand 11 states. [2018-12-31 18:25:13,496 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-12-31 18:25:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:15,523 INFO L93 Difference]: Finished difference Result 11999 states and 26613 transitions. [2018-12-31 18:25:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 18:25:15,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-31 18:25:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:15,535 INFO L225 Difference]: With dead ends: 11999 [2018-12-31 18:25:15,536 INFO L226 Difference]: Without dead ends: 8252 [2018-12-31 18:25:15,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-12-31 18:25:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8252 states. [2018-12-31 18:25:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8252 to 6342. [2018-12-31 18:25:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6342 states. [2018-12-31 18:25:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6342 states to 6342 states and 13974 transitions. [2018-12-31 18:25:15,619 INFO L78 Accepts]: Start accepts. Automaton has 6342 states and 13974 transitions. Word has length 98 [2018-12-31 18:25:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:15,619 INFO L480 AbstractCegarLoop]: Abstraction has 6342 states and 13974 transitions. [2018-12-31 18:25:15,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 18:25:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 6342 states and 13974 transitions. [2018-12-31 18:25:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:15,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:15,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:15,628 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash -450396822, now seen corresponding path program 1 times [2018-12-31 18:25:15,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:15,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:15,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 18:25:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 18:25:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 18:25:15,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 18:25:15,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 18:25:15,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 18:25:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 18:25:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 18:25:15,777 INFO L87 Difference]: Start difference. First operand 6342 states and 13974 transitions. Second operand 7 states. [2018-12-31 18:25:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 18:25:16,176 INFO L93 Difference]: Finished difference Result 6514 states and 14283 transitions. [2018-12-31 18:25:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 18:25:16,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-31 18:25:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 18:25:16,186 INFO L225 Difference]: With dead ends: 6514 [2018-12-31 18:25:16,186 INFO L226 Difference]: Without dead ends: 6514 [2018-12-31 18:25:16,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-31 18:25:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-12-31 18:25:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6137. [2018-12-31 18:25:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6137 states. [2018-12-31 18:25:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 13518 transitions. [2018-12-31 18:25:16,254 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 13518 transitions. Word has length 98 [2018-12-31 18:25:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 18:25:16,254 INFO L480 AbstractCegarLoop]: Abstraction has 6137 states and 13518 transitions. [2018-12-31 18:25:16,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 18:25:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 13518 transitions. [2018-12-31 18:25:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-31 18:25:16,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 18:25:16,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 18:25:16,263 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 18:25:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 18:25:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1013715753, now seen corresponding path program 5 times [2018-12-31 18:25:16,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 18:25:16,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 18:25:16,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:16,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 18:25:16,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 18:25:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:25:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 18:25:16,373 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 18:25:16,594 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 18:25:16,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 06:25:16 BasicIcfg [2018-12-31 18:25:16,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 18:25:16,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 18:25:16,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 18:25:16,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 18:25:16,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 06:24:12" (3/4) ... [2018-12-31 18:25:16,605 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 18:25:16,828 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 18:25:16,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 18:25:16,829 INFO L168 Benchmark]: Toolchain (without parser) took 66579.93 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 954.0 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,831 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:25:16,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1001.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,833 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,833 INFO L168 Benchmark]: Boogie Preprocessor took 45.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 18:25:16,833 INFO L168 Benchmark]: RCFGBuilder took 1263.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,834 INFO L168 Benchmark]: TraceAbstraction took 63954.55 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,834 INFO L168 Benchmark]: Witness Printer took 230.04 ms. Allocated memory is still 3.9 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. [2018-12-31 18:25:16,841 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1001.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.68 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 1263.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63954.55 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 230.04 ms. Allocated memory is still 3.9 GB. Free memory was 2.4 GB in the beginning and 2.3 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t251; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t251, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t252; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 63.7s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 34.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10404 SDtfs, 12250 SDslu, 25676 SDs, 0 SdLazy, 11722 SolverSat, 638 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 107 SyntacticMatches, 30 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66523occurred in iteration=5, 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: 14.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 143599 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 3176 NumberOfCodeBlocks, 3176 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3039 ConstructedInterpolants, 0 QuantifiedInterpolants, 714632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...