./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db4a16c4986c75df8f6a17811333c8e3362ce3a1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:38:08,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:38:08,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:38:08,146 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:38:08,146 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:38:08,147 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:38:08,150 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:38:08,152 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:38:08,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:38:08,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:38:08,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:38:08,158 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:38:08,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:38:08,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:38:08,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:38:08,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:38:08,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:38:08,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:38:08,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:38:08,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:38:08,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:38:08,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:38:08,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:38:08,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:38:08,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:38:08,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:38:08,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:38:08,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:38:08,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:38:08,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:38:08,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:38:08,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:38:08,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:38:08,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:38:08,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:38:08,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:38:08,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:38:08,232 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:38:08,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:38:08,234 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:38:08,234 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:38:08,234 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:38:08,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:38:08,235 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:38:08,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:38:08,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:38:08,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:38:08,236 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:38:08,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:38:08,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:38:08,237 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:38:08,237 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:38:08,237 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:38:08,237 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:38:08,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:38:08,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:38:08,238 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:38:08,238 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:38:08,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:38:08,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:38:08,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:38:08,239 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:38:08,239 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:38:08,239 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:38:08,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:38:08,239 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 -> db4a16c4986c75df8f6a17811333c8e3362ce3a1 [2019-01-13 05:38:08,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:38:08,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:38:08,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:38:08,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:38:08,328 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:38:08,328 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2019-01-13 05:38:08,407 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb45443/b9b3bb4da6cf4d05b195cf714fe8d972/FLAG58d81959f [2019-01-13 05:38:09,012 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:38:09,013 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe034_power.opt_false-unreach-call.i [2019-01-13 05:38:09,027 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb45443/b9b3bb4da6cf4d05b195cf714fe8d972/FLAG58d81959f [2019-01-13 05:38:09,259 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41bb45443/b9b3bb4da6cf4d05b195cf714fe8d972 [2019-01-13 05:38:09,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:38:09,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:38:09,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:38:09,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:38:09,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:38:09,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:38:09" (1/1) ... [2019-01-13 05:38:09,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:09, skipping insertion in model container [2019-01-13 05:38:09,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:38:09" (1/1) ... [2019-01-13 05:38:09,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:38:09,366 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:38:09,853 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:38:09,875 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:38:10,019 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:38:10,099 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:38:10,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10 WrapperNode [2019-01-13 05:38:10,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:38:10,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:38:10,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:38:10,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:38:10,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:38:10,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:38:10,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:38:10,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:38:10,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... [2019-01-13 05:38:10,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:38:10,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:38:10,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:38:10,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:38:10,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:38:10,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:38:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:38:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:38:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:38:10,291 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:38:10,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:38:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:38:10,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:38:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:38:10,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:38:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:38:10,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:38:10,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:38:10,295 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:38:11,380 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:38:11,381 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-13 05:38:11,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:38:11 BoogieIcfgContainer [2019-01-13 05:38:11,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:38:11,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:38:11,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:38:11,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:38:11,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:38:09" (1/3) ... [2019-01-13 05:38:11,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a2408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:38:11, skipping insertion in model container [2019-01-13 05:38:11,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:38:10" (2/3) ... [2019-01-13 05:38:11,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a2408b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:38:11, skipping insertion in model container [2019-01-13 05:38:11,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:38:11" (3/3) ... [2019-01-13 05:38:11,393 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.opt_false-unreach-call.i [2019-01-13 05:38:11,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,439 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,439 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,440 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,440 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,441 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,442 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,443 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,444 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,444 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,447 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,448 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,455 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,456 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,457 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,459 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,460 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,462 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,463 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,464 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,465 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,467 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,468 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,470 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,471 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,472 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,473 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,474 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,475 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,479 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,479 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,480 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,480 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,480 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,480 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,480 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,481 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,483 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,483 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,485 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,486 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,486 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,486 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,486 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,486 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,487 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,493 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,494 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:38:11,512 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:38:11,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:38:11,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-13 05:38:11,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-13 05:38:11,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:38:11,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:38:11,568 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:38:11,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:38:11,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:38:11,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:38:11,568 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:38:11,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:38:11,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:38:11,583 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 144places, 175 transitions [2019-01-13 05:38:42,368 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149043 states. [2019-01-13 05:38:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149043 states. [2019-01-13 05:38:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-13 05:38:42,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:38:42,389 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] [2019-01-13 05:38:42,392 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:38:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:38:42,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1284724798, now seen corresponding path program 1 times [2019-01-13 05:38:42,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:38:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:38:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:38:42,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:38:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:38:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:38:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:38:42,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:38:42,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:38:42,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:38:42,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:38:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:38:42,808 INFO L87 Difference]: Start difference. First operand 149043 states. Second operand 4 states. [2019-01-13 05:38:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:38:45,077 INFO L93 Difference]: Finished difference Result 257063 states and 1188602 transitions. [2019-01-13 05:38:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:38:45,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-13 05:38:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:38:46,341 INFO L225 Difference]: With dead ends: 257063 [2019-01-13 05:38:46,342 INFO L226 Difference]: Without dead ends: 174813 [2019-01-13 05:38:46,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:38:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174813 states. [2019-01-13 05:38:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174813 to 110553. [2019-01-13 05:38:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-13 05:38:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511484 transitions. [2019-01-13 05:38:58,704 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511484 transitions. Word has length 44 [2019-01-13 05:38:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:38:58,706 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511484 transitions. [2019-01-13 05:38:58,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:38:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511484 transitions. [2019-01-13 05:38:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 05:38:58,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:38:58,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:38:58,733 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:38:58,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:38:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1885719038, now seen corresponding path program 1 times [2019-01-13 05:38:58,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:38:58,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:38:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:38:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:38:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:38:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:38:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:38:58,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:38:58,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:38:58,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:38:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:38:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:38:58,893 INFO L87 Difference]: Start difference. First operand 110553 states and 511484 transitions. Second operand 3 states. [2019-01-13 05:39:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:02,176 INFO L93 Difference]: Finished difference Result 110553 states and 511379 transitions. [2019-01-13 05:39:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:39:02,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-01-13 05:39:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:02,705 INFO L225 Difference]: With dead ends: 110553 [2019-01-13 05:39:02,706 INFO L226 Difference]: Without dead ends: 110553 [2019-01-13 05:39:02,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:39:03,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110553 states. [2019-01-13 05:39:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110553 to 110553. [2019-01-13 05:39:05,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110553 states. [2019-01-13 05:39:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110553 states to 110553 states and 511379 transitions. [2019-01-13 05:39:05,736 INFO L78 Accepts]: Start accepts. Automaton has 110553 states and 511379 transitions. Word has length 52 [2019-01-13 05:39:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:05,737 INFO L480 AbstractCegarLoop]: Abstraction has 110553 states and 511379 transitions. [2019-01-13 05:39:05,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:39:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 110553 states and 511379 transitions. [2019-01-13 05:39:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 05:39:05,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:05,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:05,753 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:05,754 INFO L82 PathProgramCache]: Analyzing trace with hash -142908703, now seen corresponding path program 1 times [2019-01-13 05:39:05,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:05,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:39:05,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:39:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:39:05,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:05,910 INFO L87 Difference]: Start difference. First operand 110553 states and 511379 transitions. Second operand 4 states. [2019-01-13 05:39:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:08,412 INFO L93 Difference]: Finished difference Result 99451 states and 448604 transitions. [2019-01-13 05:39:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:39:08,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-13 05:39:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:08,935 INFO L225 Difference]: With dead ends: 99451 [2019-01-13 05:39:08,935 INFO L226 Difference]: Without dead ends: 95221 [2019-01-13 05:39:08,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:39:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95221 states. [2019-01-13 05:39:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95221 to 95221. [2019-01-13 05:39:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95221 states. [2019-01-13 05:39:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95221 states to 95221 states and 432988 transitions. [2019-01-13 05:39:11,886 INFO L78 Accepts]: Start accepts. Automaton has 95221 states and 432988 transitions. Word has length 52 [2019-01-13 05:39:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:11,887 INFO L480 AbstractCegarLoop]: Abstraction has 95221 states and 432988 transitions. [2019-01-13 05:39:11,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:39:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 95221 states and 432988 transitions. [2019-01-13 05:39:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 05:39:11,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:11,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] [2019-01-13 05:39:11,902 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash -805360345, now seen corresponding path program 1 times [2019-01-13 05:39:11,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:11,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:12,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:12,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:39:12,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:39:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:39:12,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:39:12,062 INFO L87 Difference]: Start difference. First operand 95221 states and 432988 transitions. Second operand 5 states. [2019-01-13 05:39:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:12,392 INFO L93 Difference]: Finished difference Result 30965 states and 124168 transitions. [2019-01-13 05:39:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:39:12,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-13 05:39:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:12,490 INFO L225 Difference]: With dead ends: 30965 [2019-01-13 05:39:12,490 INFO L226 Difference]: Without dead ends: 27337 [2019-01-13 05:39:12,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-01-13 05:39:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 26877. [2019-01-13 05:39:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26877 states. [2019-01-13 05:39:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26877 states to 26877 states and 107650 transitions. [2019-01-13 05:39:13,003 INFO L78 Accepts]: Start accepts. Automaton has 26877 states and 107650 transitions. Word has length 53 [2019-01-13 05:39:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:13,003 INFO L480 AbstractCegarLoop]: Abstraction has 26877 states and 107650 transitions. [2019-01-13 05:39:13,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:39:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26877 states and 107650 transitions. [2019-01-13 05:39:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-13 05:39:13,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:13,008 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] [2019-01-13 05:39:13,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1570820033, now seen corresponding path program 1 times [2019-01-13 05:39:13,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:13,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:13,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:13,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:13,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:13,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:13,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:13,292 INFO L87 Difference]: Start difference. First operand 26877 states and 107650 transitions. Second operand 6 states. [2019-01-13 05:39:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:14,103 INFO L93 Difference]: Finished difference Result 37429 states and 146187 transitions. [2019-01-13 05:39:14,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:39:14,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-01-13 05:39:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:14,196 INFO L225 Difference]: With dead ends: 37429 [2019-01-13 05:39:14,196 INFO L226 Difference]: Without dead ends: 37054 [2019-01-13 05:39:14,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:39:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37054 states. [2019-01-13 05:39:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37054 to 35270. [2019-01-13 05:39:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35270 states. [2019-01-13 05:39:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35270 states to 35270 states and 138745 transitions. [2019-01-13 05:39:15,424 INFO L78 Accepts]: Start accepts. Automaton has 35270 states and 138745 transitions. Word has length 53 [2019-01-13 05:39:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:15,424 INFO L480 AbstractCegarLoop]: Abstraction has 35270 states and 138745 transitions. [2019-01-13 05:39:15,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 35270 states and 138745 transitions. [2019-01-13 05:39:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-13 05:39:15,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:15,430 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] [2019-01-13 05:39:15,430 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2068992963, now seen corresponding path program 1 times [2019-01-13 05:39:15,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:15,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:15,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:15,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:15,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:15,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:39:15,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:39:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:39:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:39:15,535 INFO L87 Difference]: Start difference. First operand 35270 states and 138745 transitions. Second operand 3 states. [2019-01-13 05:39:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:15,794 INFO L93 Difference]: Finished difference Result 46810 states and 182037 transitions. [2019-01-13 05:39:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:39:15,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-01-13 05:39:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:15,913 INFO L225 Difference]: With dead ends: 46810 [2019-01-13 05:39:15,913 INFO L226 Difference]: Without dead ends: 46790 [2019-01-13 05:39:15,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:39:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46790 states. [2019-01-13 05:39:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46790 to 36252. [2019-01-13 05:39:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36252 states. [2019-01-13 05:39:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36252 states to 36252 states and 141452 transitions. [2019-01-13 05:39:16,705 INFO L78 Accepts]: Start accepts. Automaton has 36252 states and 141452 transitions. Word has length 55 [2019-01-13 05:39:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:16,706 INFO L480 AbstractCegarLoop]: Abstraction has 36252 states and 141452 transitions. [2019-01-13 05:39:16,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:39:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36252 states and 141452 transitions. [2019-01-13 05:39:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 05:39:16,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:16,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:16,713 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -43565154, now seen corresponding path program 1 times [2019-01-13 05:39:16,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:16,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:16,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:16,858 INFO L87 Difference]: Start difference. First operand 36252 states and 141452 transitions. Second operand 6 states. [2019-01-13 05:39:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:17,782 INFO L93 Difference]: Finished difference Result 50344 states and 193874 transitions. [2019-01-13 05:39:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:39:17,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-13 05:39:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:17,929 INFO L225 Difference]: With dead ends: 50344 [2019-01-13 05:39:17,929 INFO L226 Difference]: Without dead ends: 49859 [2019-01-13 05:39:17,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:39:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49859 states. [2019-01-13 05:39:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49859 to 39286. [2019-01-13 05:39:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39286 states. [2019-01-13 05:39:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39286 states to 39286 states and 153273 transitions. [2019-01-13 05:39:18,749 INFO L78 Accepts]: Start accepts. Automaton has 39286 states and 153273 transitions. Word has length 59 [2019-01-13 05:39:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:18,749 INFO L480 AbstractCegarLoop]: Abstraction has 39286 states and 153273 transitions. [2019-01-13 05:39:18,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39286 states and 153273 transitions. [2019-01-13 05:39:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:39:18,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:18,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:18,775 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash -41019099, now seen corresponding path program 1 times [2019-01-13 05:39:18,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:18,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:18,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:18,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:39:18,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:39:18,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:39:18,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:18,885 INFO L87 Difference]: Start difference. First operand 39286 states and 153273 transitions. Second operand 4 states. [2019-01-13 05:39:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:19,344 INFO L93 Difference]: Finished difference Result 46149 states and 179276 transitions. [2019-01-13 05:39:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:39:19,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-13 05:39:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:19,459 INFO L225 Difference]: With dead ends: 46149 [2019-01-13 05:39:19,460 INFO L226 Difference]: Without dead ends: 46149 [2019-01-13 05:39:19,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:39:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46149 states. [2019-01-13 05:39:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46149 to 42181. [2019-01-13 05:39:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42181 states. [2019-01-13 05:39:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42181 states to 42181 states and 164108 transitions. [2019-01-13 05:39:20,278 INFO L78 Accepts]: Start accepts. Automaton has 42181 states and 164108 transitions. Word has length 70 [2019-01-13 05:39:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:20,278 INFO L480 AbstractCegarLoop]: Abstraction has 42181 states and 164108 transitions. [2019-01-13 05:39:20,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:39:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 42181 states and 164108 transitions. [2019-01-13 05:39:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-13 05:39:20,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:20,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:20,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1701791236, now seen corresponding path program 1 times [2019-01-13 05:39:20,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:20,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:20,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:20,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:20,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:20,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:20,662 INFO L87 Difference]: Start difference. First operand 42181 states and 164108 transitions. Second operand 6 states. [2019-01-13 05:39:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:21,128 INFO L93 Difference]: Finished difference Result 13861 states and 46332 transitions. [2019-01-13 05:39:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:39:21,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-01-13 05:39:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:21,150 INFO L225 Difference]: With dead ends: 13861 [2019-01-13 05:39:21,150 INFO L226 Difference]: Without dead ends: 11605 [2019-01-13 05:39:21,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:39:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11605 states. [2019-01-13 05:39:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11605 to 11015. [2019-01-13 05:39:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11015 states. [2019-01-13 05:39:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11015 states to 11015 states and 36284 transitions. [2019-01-13 05:39:21,319 INFO L78 Accepts]: Start accepts. Automaton has 11015 states and 36284 transitions. Word has length 70 [2019-01-13 05:39:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:21,320 INFO L480 AbstractCegarLoop]: Abstraction has 11015 states and 36284 transitions. [2019-01-13 05:39:21,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11015 states and 36284 transitions. [2019-01-13 05:39:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:21,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:21,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:21,340 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 577239524, now seen corresponding path program 1 times [2019-01-13 05:39:21,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:21,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:21,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:21,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:21,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:39:21,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:39:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:39:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:21,556 INFO L87 Difference]: Start difference. First operand 11015 states and 36284 transitions. Second operand 4 states. [2019-01-13 05:39:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:21,920 INFO L93 Difference]: Finished difference Result 16578 states and 54918 transitions. [2019-01-13 05:39:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:39:21,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-13 05:39:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:21,951 INFO L225 Difference]: With dead ends: 16578 [2019-01-13 05:39:21,951 INFO L226 Difference]: Without dead ends: 16578 [2019-01-13 05:39:21,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2019-01-13 05:39:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 11143. [2019-01-13 05:39:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11143 states. [2019-01-13 05:39:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11143 states to 11143 states and 36700 transitions. [2019-01-13 05:39:22,151 INFO L78 Accepts]: Start accepts. Automaton has 11143 states and 36700 transitions. Word has length 89 [2019-01-13 05:39:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 11143 states and 36700 transitions. [2019-01-13 05:39:22,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:39:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11143 states and 36700 transitions. [2019-01-13 05:39:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:22,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:22,173 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] [2019-01-13 05:39:22,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:22,174 INFO L82 PathProgramCache]: Analyzing trace with hash 870642531, now seen corresponding path program 1 times [2019-01-13 05:39:22,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:22,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:22,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:22,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:22,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:39:22,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:39:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:39:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:39:22,362 INFO L87 Difference]: Start difference. First operand 11143 states and 36700 transitions. Second operand 5 states. [2019-01-13 05:39:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:22,914 INFO L93 Difference]: Finished difference Result 17352 states and 55701 transitions. [2019-01-13 05:39:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:39:22,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-01-13 05:39:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:22,945 INFO L225 Difference]: With dead ends: 17352 [2019-01-13 05:39:22,946 INFO L226 Difference]: Without dead ends: 17352 [2019-01-13 05:39:22,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:39:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2019-01-13 05:39:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 14130. [2019-01-13 05:39:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14130 states. [2019-01-13 05:39:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14130 states to 14130 states and 45724 transitions. [2019-01-13 05:39:23,179 INFO L78 Accepts]: Start accepts. Automaton has 14130 states and 45724 transitions. Word has length 89 [2019-01-13 05:39:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:23,179 INFO L480 AbstractCegarLoop]: Abstraction has 14130 states and 45724 transitions. [2019-01-13 05:39:23,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:39:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 14130 states and 45724 transitions. [2019-01-13 05:39:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:23,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:23,201 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] [2019-01-13 05:39:23,201 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1718399175, now seen corresponding path program 2 times [2019-01-13 05:39:23,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:23,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:23,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:23,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:23,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 05:39:23,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 05:39:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 05:39:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:39:23,333 INFO L87 Difference]: Start difference. First operand 14130 states and 45724 transitions. Second operand 3 states. [2019-01-13 05:39:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:23,616 INFO L93 Difference]: Finished difference Result 15240 states and 49177 transitions. [2019-01-13 05:39:23,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 05:39:23,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-01-13 05:39:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:23,644 INFO L225 Difference]: With dead ends: 15240 [2019-01-13 05:39:23,644 INFO L226 Difference]: Without dead ends: 15240 [2019-01-13 05:39:23,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 05:39:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-01-13 05:39:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 14740. [2019-01-13 05:39:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14740 states. [2019-01-13 05:39:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14740 states to 14740 states and 47632 transitions. [2019-01-13 05:39:23,863 INFO L78 Accepts]: Start accepts. Automaton has 14740 states and 47632 transitions. Word has length 89 [2019-01-13 05:39:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:23,864 INFO L480 AbstractCegarLoop]: Abstraction has 14740 states and 47632 transitions. [2019-01-13 05:39:23,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 05:39:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14740 states and 47632 transitions. [2019-01-13 05:39:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:23,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:23,884 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] [2019-01-13 05:39:23,885 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:23,885 INFO L82 PathProgramCache]: Analyzing trace with hash -795426203, now seen corresponding path program 3 times [2019-01-13 05:39:23,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:23,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:23,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:23,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:39:23,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:24,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:24,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:39:24,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:39:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:39:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:24,055 INFO L87 Difference]: Start difference. First operand 14740 states and 47632 transitions. Second operand 4 states. [2019-01-13 05:39:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:24,239 INFO L93 Difference]: Finished difference Result 15572 states and 50400 transitions. [2019-01-13 05:39:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 05:39:24,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-01-13 05:39:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:24,267 INFO L225 Difference]: With dead ends: 15572 [2019-01-13 05:39:24,267 INFO L226 Difference]: Without dead ends: 15572 [2019-01-13 05:39:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:39:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15572 states. [2019-01-13 05:39:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15572 to 14996. [2019-01-13 05:39:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14996 states. [2019-01-13 05:39:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14996 states to 14996 states and 48528 transitions. [2019-01-13 05:39:24,502 INFO L78 Accepts]: Start accepts. Automaton has 14996 states and 48528 transitions. Word has length 89 [2019-01-13 05:39:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:24,502 INFO L480 AbstractCegarLoop]: Abstraction has 14996 states and 48528 transitions. [2019-01-13 05:39:24,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:39:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14996 states and 48528 transitions. [2019-01-13 05:39:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:24,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:24,526 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] [2019-01-13 05:39:24,527 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1692086630, now seen corresponding path program 1 times [2019-01-13 05:39:24,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:24,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:39:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:25,077 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 10 [2019-01-13 05:39:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:25,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:25,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:25,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:25,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:25,255 INFO L87 Difference]: Start difference. First operand 14996 states and 48528 transitions. Second operand 6 states. [2019-01-13 05:39:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:26,766 INFO L93 Difference]: Finished difference Result 21841 states and 70209 transitions. [2019-01-13 05:39:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:39:26,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:39:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:26,808 INFO L225 Difference]: With dead ends: 21841 [2019-01-13 05:39:26,808 INFO L226 Difference]: Without dead ends: 21713 [2019-01-13 05:39:26,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21713 states. [2019-01-13 05:39:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21713 to 18566. [2019-01-13 05:39:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18566 states. [2019-01-13 05:39:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 59975 transitions. [2019-01-13 05:39:27,164 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 59975 transitions. Word has length 89 [2019-01-13 05:39:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:27,164 INFO L480 AbstractCegarLoop]: Abstraction has 18566 states and 59975 transitions. [2019-01-13 05:39:27,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 59975 transitions. [2019-01-13 05:39:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:27,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:27,204 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] [2019-01-13 05:39:27,204 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash -104864729, now seen corresponding path program 1 times [2019-01-13 05:39:27,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:27,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:27,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:39:27,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:39:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:39:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:27,665 INFO L87 Difference]: Start difference. First operand 18566 states and 59975 transitions. Second operand 7 states. [2019-01-13 05:39:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:28,649 INFO L93 Difference]: Finished difference Result 36185 states and 117444 transitions. [2019-01-13 05:39:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 05:39:28,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-13 05:39:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:28,715 INFO L225 Difference]: With dead ends: 36185 [2019-01-13 05:39:28,715 INFO L226 Difference]: Without dead ends: 36185 [2019-01-13 05:39:28,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-13 05:39:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36185 states. [2019-01-13 05:39:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36185 to 22484. [2019-01-13 05:39:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-01-13 05:39:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 73108 transitions. [2019-01-13 05:39:29,171 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 73108 transitions. Word has length 89 [2019-01-13 05:39:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:29,171 INFO L480 AbstractCegarLoop]: Abstraction has 22484 states and 73108 transitions. [2019-01-13 05:39:29,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:39:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 73108 transitions. [2019-01-13 05:39:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:29,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:29,203 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] [2019-01-13 05:39:29,204 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 782638952, now seen corresponding path program 1 times [2019-01-13 05:39:29,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:29,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:29,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:29,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:29,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:30,035 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-01-13 05:39:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:30,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:30,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:30,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:30,063 INFO L87 Difference]: Start difference. First operand 22484 states and 73108 transitions. Second operand 6 states. [2019-01-13 05:39:30,498 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2019-01-13 05:39:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:31,326 INFO L93 Difference]: Finished difference Result 23682 states and 76189 transitions. [2019-01-13 05:39:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 05:39:31,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:39:31,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:31,368 INFO L225 Difference]: With dead ends: 23682 [2019-01-13 05:39:31,368 INFO L226 Difference]: Without dead ends: 23682 [2019-01-13 05:39:31,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:39:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2019-01-13 05:39:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 19210. [2019-01-13 05:39:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19210 states. [2019-01-13 05:39:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19210 states to 19210 states and 61587 transitions. [2019-01-13 05:39:31,676 INFO L78 Accepts]: Start accepts. Automaton has 19210 states and 61587 transitions. Word has length 89 [2019-01-13 05:39:31,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:31,677 INFO L480 AbstractCegarLoop]: Abstraction has 19210 states and 61587 transitions. [2019-01-13 05:39:31,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 19210 states and 61587 transitions. [2019-01-13 05:39:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:31,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:31,702 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] [2019-01-13 05:39:31,703 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:31,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash -412334768, now seen corresponding path program 1 times [2019-01-13 05:39:31,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:31,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:31,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:31,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:31,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:31,862 INFO L87 Difference]: Start difference. First operand 19210 states and 61587 transitions. Second operand 6 states. [2019-01-13 05:39:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:32,581 INFO L93 Difference]: Finished difference Result 22660 states and 71757 transitions. [2019-01-13 05:39:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:39:32,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:39:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:32,620 INFO L225 Difference]: With dead ends: 22660 [2019-01-13 05:39:32,620 INFO L226 Difference]: Without dead ends: 22140 [2019-01-13 05:39:32,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22140 states. [2019-01-13 05:39:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22140 to 20895. [2019-01-13 05:39:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-01-13 05:39:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 66740 transitions. [2019-01-13 05:39:32,931 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 66740 transitions. Word has length 89 [2019-01-13 05:39:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:32,931 INFO L480 AbstractCegarLoop]: Abstraction has 20895 states and 66740 transitions. [2019-01-13 05:39:32,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 66740 transitions. [2019-01-13 05:39:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:33,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:33,168 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] [2019-01-13 05:39:33,169 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1928533223, now seen corresponding path program 1 times [2019-01-13 05:39:33,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:33,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:39:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:39:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:39:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:33,784 INFO L87 Difference]: Start difference. First operand 20895 states and 66740 transitions. Second operand 7 states. [2019-01-13 05:39:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:34,450 INFO L93 Difference]: Finished difference Result 23643 states and 75439 transitions. [2019-01-13 05:39:34,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:39:34,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-01-13 05:39:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:34,492 INFO L225 Difference]: With dead ends: 23643 [2019-01-13 05:39:34,492 INFO L226 Difference]: Without dead ends: 23643 [2019-01-13 05:39:34,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23643 states. [2019-01-13 05:39:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23643 to 21045. [2019-01-13 05:39:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21045 states. [2019-01-13 05:39:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21045 states to 21045 states and 67380 transitions. [2019-01-13 05:39:34,823 INFO L78 Accepts]: Start accepts. Automaton has 21045 states and 67380 transitions. Word has length 89 [2019-01-13 05:39:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:34,823 INFO L480 AbstractCegarLoop]: Abstraction has 21045 states and 67380 transitions. [2019-01-13 05:39:34,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:39:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 21045 states and 67380 transitions. [2019-01-13 05:39:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:34,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:34,852 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] [2019-01-13 05:39:34,853 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:34,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1872528687, now seen corresponding path program 1 times [2019-01-13 05:39:34,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:34,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:34,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:34,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:35,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:35,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:35,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:35,137 INFO L87 Difference]: Start difference. First operand 21045 states and 67380 transitions. Second operand 6 states. [2019-01-13 05:39:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:35,566 INFO L93 Difference]: Finished difference Result 23210 states and 72642 transitions. [2019-01-13 05:39:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:39:35,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:39:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:35,606 INFO L225 Difference]: With dead ends: 23210 [2019-01-13 05:39:35,606 INFO L226 Difference]: Without dead ends: 23210 [2019-01-13 05:39:35,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:39:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23210 states. [2019-01-13 05:39:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23210 to 21470. [2019-01-13 05:39:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-01-13 05:39:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 67540 transitions. [2019-01-13 05:39:35,931 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 67540 transitions. Word has length 89 [2019-01-13 05:39:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:35,931 INFO L480 AbstractCegarLoop]: Abstraction has 21470 states and 67540 transitions. [2019-01-13 05:39:35,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 67540 transitions. [2019-01-13 05:39:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-13 05:39:35,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:35,960 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] [2019-01-13 05:39:35,960 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1617792142, now seen corresponding path program 1 times [2019-01-13 05:39:35,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:35,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:35,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:35,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:36,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:36,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:36,324 INFO L87 Difference]: Start difference. First operand 21470 states and 67540 transitions. Second operand 6 states. [2019-01-13 05:39:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:36,584 INFO L93 Difference]: Finished difference Result 19998 states and 61732 transitions. [2019-01-13 05:39:36,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:39:36,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-01-13 05:39:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:36,618 INFO L225 Difference]: With dead ends: 19998 [2019-01-13 05:39:36,618 INFO L226 Difference]: Without dead ends: 19998 [2019-01-13 05:39:36,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19998 states. [2019-01-13 05:39:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19998 to 12659. [2019-01-13 05:39:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12659 states. [2019-01-13 05:39:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 39042 transitions. [2019-01-13 05:39:36,859 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 39042 transitions. Word has length 89 [2019-01-13 05:39:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:36,860 INFO L480 AbstractCegarLoop]: Abstraction has 12659 states and 39042 transitions. [2019-01-13 05:39:36,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 39042 transitions. [2019-01-13 05:39:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:36,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:36,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:36,877 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash 368979928, now seen corresponding path program 1 times [2019-01-13 05:39:36,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:37,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:37,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:39:37,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:39:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:39:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:39:37,337 INFO L87 Difference]: Start difference. First operand 12659 states and 39042 transitions. Second operand 6 states. [2019-01-13 05:39:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:37,645 INFO L93 Difference]: Finished difference Result 14589 states and 44651 transitions. [2019-01-13 05:39:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:39:37,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-01-13 05:39:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:37,669 INFO L225 Difference]: With dead ends: 14589 [2019-01-13 05:39:37,669 INFO L226 Difference]: Without dead ends: 14299 [2019-01-13 05:39:37,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:39:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14299 states. [2019-01-13 05:39:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14299 to 11174. [2019-01-13 05:39:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11174 states. [2019-01-13 05:39:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 34174 transitions. [2019-01-13 05:39:37,851 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 34174 transitions. Word has length 91 [2019-01-13 05:39:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:37,852 INFO L480 AbstractCegarLoop]: Abstraction has 11174 states and 34174 transitions. [2019-01-13 05:39:37,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:39:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 34174 transitions. [2019-01-13 05:39:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:37,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:37,866 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] [2019-01-13 05:39:37,866 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:37,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1708229415, now seen corresponding path program 1 times [2019-01-13 05:39:37,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:37,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:37,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:37,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:38,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:38,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 05:39:38,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 05:39:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 05:39:38,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:39:38,298 INFO L87 Difference]: Start difference. First operand 11174 states and 34174 transitions. Second operand 9 states. [2019-01-13 05:39:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:38,704 INFO L93 Difference]: Finished difference Result 13111 states and 40031 transitions. [2019-01-13 05:39:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 05:39:38,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-01-13 05:39:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:38,734 INFO L225 Difference]: With dead ends: 13111 [2019-01-13 05:39:38,734 INFO L226 Difference]: Without dead ends: 13111 [2019-01-13 05:39:38,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-01-13 05:39:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13111 states. [2019-01-13 05:39:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13111 to 12772. [2019-01-13 05:39:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12772 states. [2019-01-13 05:39:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 39053 transitions. [2019-01-13 05:39:38,941 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 39053 transitions. Word has length 91 [2019-01-13 05:39:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:38,942 INFO L480 AbstractCegarLoop]: Abstraction has 12772 states and 39053 transitions. [2019-01-13 05:39:38,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 05:39:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 39053 transitions. [2019-01-13 05:39:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:38,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:38,961 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] [2019-01-13 05:39:38,961 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -820725734, now seen corresponding path program 1 times [2019-01-13 05:39:38,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:38,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:39,133 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 05:39:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:39,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:39,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 05:39:39,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 05:39:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 05:39:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-13 05:39:39,186 INFO L87 Difference]: Start difference. First operand 12772 states and 39053 transitions. Second operand 8 states. [2019-01-13 05:39:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:39,784 INFO L93 Difference]: Finished difference Result 22526 states and 68777 transitions. [2019-01-13 05:39:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:39:39,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-01-13 05:39:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:39,805 INFO L225 Difference]: With dead ends: 22526 [2019-01-13 05:39:39,805 INFO L226 Difference]: Without dead ends: 11514 [2019-01-13 05:39:39,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:39:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-01-13 05:39:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 10920. [2019-01-13 05:39:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-01-13 05:39:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33137 transitions. [2019-01-13 05:39:39,964 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33137 transitions. Word has length 91 [2019-01-13 05:39:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:39,964 INFO L480 AbstractCegarLoop]: Abstraction has 10920 states and 33137 transitions. [2019-01-13 05:39:39,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 05:39:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33137 transitions. [2019-01-13 05:39:39,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:39,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:39,979 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] [2019-01-13 05:39:39,979 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:39,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash -148260104, now seen corresponding path program 2 times [2019-01-13 05:39:39,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:39,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:39,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:39,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:39,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:40,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 05:39:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 05:39:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 05:39:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:39:40,153 INFO L87 Difference]: Start difference. First operand 10920 states and 33137 transitions. Second operand 10 states. [2019-01-13 05:39:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:41,017 INFO L93 Difference]: Finished difference Result 18376 states and 56010 transitions. [2019-01-13 05:39:41,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:39:41,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-01-13 05:39:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:41,029 INFO L225 Difference]: With dead ends: 18376 [2019-01-13 05:39:41,029 INFO L226 Difference]: Without dead ends: 6510 [2019-01-13 05:39:41,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-01-13 05:39:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-13 05:39:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6510. [2019-01-13 05:39:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6510 states. [2019-01-13 05:39:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 19834 transitions. [2019-01-13 05:39:41,122 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 19834 transitions. Word has length 91 [2019-01-13 05:39:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:41,123 INFO L480 AbstractCegarLoop]: Abstraction has 6510 states and 19834 transitions. [2019-01-13 05:39:41,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 05:39:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 19834 transitions. [2019-01-13 05:39:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:41,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:41,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 05:39:41,132 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:41,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1433608860, now seen corresponding path program 1 times [2019-01-13 05:39:41,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:41,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:41,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:39:41,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:39:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:39:41,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:39:41,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 05:39:41,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 05:39:41,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 05:39:41,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:39:41,369 INFO L87 Difference]: Start difference. First operand 6510 states and 19834 transitions. Second operand 10 states. [2019-01-13 05:39:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:39:42,941 INFO L93 Difference]: Finished difference Result 11674 states and 35575 transitions. [2019-01-13 05:39:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 05:39:42,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-01-13 05:39:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:39:42,963 INFO L225 Difference]: With dead ends: 11674 [2019-01-13 05:39:42,963 INFO L226 Difference]: Without dead ends: 11674 [2019-01-13 05:39:42,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-01-13 05:39:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11674 states. [2019-01-13 05:39:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11674 to 8262. [2019-01-13 05:39:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8262 states. [2019-01-13 05:39:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8262 states to 8262 states and 25168 transitions. [2019-01-13 05:39:43,097 INFO L78 Accepts]: Start accepts. Automaton has 8262 states and 25168 transitions. Word has length 91 [2019-01-13 05:39:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:39:43,097 INFO L480 AbstractCegarLoop]: Abstraction has 8262 states and 25168 transitions. [2019-01-13 05:39:43,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 05:39:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8262 states and 25168 transitions. [2019-01-13 05:39:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-13 05:39:43,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:39:43,108 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] [2019-01-13 05:39:43,108 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:39:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:39:43,109 INFO L82 PathProgramCache]: Analyzing trace with hash -546105179, now seen corresponding path program 1 times [2019-01-13 05:39:43,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:39:43,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:39:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:43,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:39:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:39:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:39:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 05:39:43,203 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 05:39:43,389 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:39:43,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:39:43 BasicIcfg [2019-01-13 05:39:43,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:39:43,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:39:43,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:39:43,391 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:39:43,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:38:11" (3/4) ... [2019-01-13 05:39:43,397 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 05:39:43,613 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:39:43,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:39:43,614 INFO L168 Benchmark]: Toolchain (without parser) took 94350.20 ms. Allocated memory was 1.0 GB in the beginning and 5.7 GB in the end (delta: 4.7 GB). Free memory was 943.3 MB in the beginning and 1.4 GB in the end (delta: -500.8 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,615 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:39:43,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,618 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:39:43,618 INFO L168 Benchmark]: RCFGBuilder took 1178.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,619 INFO L168 Benchmark]: TraceAbstraction took 92004.50 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.7 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,622 INFO L168 Benchmark]: Witness Printer took 221.95 ms. Allocated memory is still 5.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-01-13 05:39:43,625 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 833.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1178.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92004.50 ms. Allocated memory was 1.1 GB in the beginning and 5.7 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -467.7 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 221.95 ms. Allocated memory is still 5.7 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t2582; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t2582, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t2583; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t2583, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t2584; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t2584, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 z = 2 [L711] 1 __unbuffered_p0_EAX = x [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L723] 2 x = 1 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L769] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L770] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L772] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L775] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L802] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L803] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L804] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] -1 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 217 locations, 3 error locations. UNSAFE Result, 91.8s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 25.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6076 SDtfs, 8197 SDslu, 13784 SDs, 0 SdLazy, 5179 SolverSat, 296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 65 SyntacticMatches, 14 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149043occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 26.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 143618 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2033 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 405911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...