./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer --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 47114b7025e0370460384816fc34be8953a40ffc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-01 17:50:43,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:50:43,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:50:43,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:50:43,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:50:43,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:50:43,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:50:43,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:50:43,329 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:50:43,330 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:50:43,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:50:43,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:50:43,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:50:43,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:50:43,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:50:43,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:50:43,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:50:43,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:50:43,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:50:43,338 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:50:43,339 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:50:43,340 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:50:43,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:50:43,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:50:43,342 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:50:43,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:50:43,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:50:43,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:50:43,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:50:43,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:50:43,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:50:43,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:50:43,346 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:50:43,346 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:50:43,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:50:43,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:50:43,348 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 17:50:43,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:50:43,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:50:43,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 17:50:43,358 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 17:50:43,359 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:50:43,359 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:50:43,359 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:50:43,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:50:43,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:50:43,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 17:50:43,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 17:50:43,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:50:43,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:50:43,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 17:50:43,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 17:50:43,362 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:50:43,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 17:50:43,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 17:50:43,362 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer 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 -> 47114b7025e0370460384816fc34be8953a40ffc [2018-12-01 17:50:43,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:50:43,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:50:43,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:50:43,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:50:43,398 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:50:43,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2018-12-01 17:50:43,441 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/data/7ec675b55/8bb383aeb82c4fe88f082395589b24d9/FLAG77f6d4ee5 [2018-12-01 17:50:43,867 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:50:43,868 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2018-12-01 17:50:43,875 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/data/7ec675b55/8bb383aeb82c4fe88f082395589b24d9/FLAG77f6d4ee5 [2018-12-01 17:50:43,883 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/data/7ec675b55/8bb383aeb82c4fe88f082395589b24d9 [2018-12-01 17:50:43,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:50:43,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:50:43,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:50:43,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:50:43,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:50:43,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:50:43" (1/1) ... [2018-12-01 17:50:43,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:43, skipping insertion in model container [2018-12-01 17:50:43,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:50:43" (1/1) ... [2018-12-01 17:50:43,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:50:43,920 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:50:44,107 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:50:44,115 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:50:44,190 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:50:44,229 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:50:44,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44 WrapperNode [2018-12-01 17:50:44,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:50:44,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:50:44,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:50:44,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:50:44,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:50:44,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:50:44,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:50:44,264 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:50:44,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... [2018-12-01 17:50:44,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:50:44,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:50:44,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:50:44,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:50:44,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 17:50:44,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:50:44,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:50:44,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 17:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 17:50:44,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 17:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 17:50:44,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 17:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 17:50:44,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:50:44,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:50:44,320 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 17:50:44,634 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:50:44,634 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 17:50:44,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:50:44 BoogieIcfgContainer [2018-12-01 17:50:44,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:50:44,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 17:50:44,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 17:50:44,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 17:50:44,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 05:50:43" (1/3) ... [2018-12-01 17:50:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b19d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:50:44, skipping insertion in model container [2018-12-01 17:50:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:50:44" (2/3) ... [2018-12-01 17:50:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b19d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 05:50:44, skipping insertion in model container [2018-12-01 17:50:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:50:44" (3/3) ... [2018-12-01 17:50:44,639 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_false-unreach-call.i [2018-12-01 17:50:44,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,661 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,662 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,663 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,664 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,665 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 17:50:44,676 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 17:50:44,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 17:50:44,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 17:50:44,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 17:50:44,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:50:44,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 17:50:44,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 17:50:44,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 17:50:44,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:50:44,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:50:44,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 17:50:44,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:50:44,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 17:50:44,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-01 17:50:45,683 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2018-12-01 17:50:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2018-12-01 17:50:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 17:50:45,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:45,690 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] [2018-12-01 17:50:45,692 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:45,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2018-12-01 17:50:45,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:45,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:45,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:45,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:50:45,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:50:45,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:50:45,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:45,849 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2018-12-01 17:50:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:46,189 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2018-12-01 17:50:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:50:46,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-01 17:50:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:46,338 INFO L225 Difference]: With dead ends: 45386 [2018-12-01 17:50:46,339 INFO L226 Difference]: Without dead ends: 40626 [2018-12-01 17:50:46,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2018-12-01 17:50:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2018-12-01 17:50:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2018-12-01 17:50:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2018-12-01 17:50:47,021 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2018-12-01 17:50:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:47,022 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2018-12-01 17:50:47,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:50:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2018-12-01 17:50:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-01 17:50:47,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:47,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:47,025 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:47,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1049069648, now seen corresponding path program 1 times [2018-12-01 17:50:47,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:47,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:47,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:47,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:47,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:47,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:47,081 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2018-12-01 17:50:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:47,698 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2018-12-01 17:50:47,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 17:50:47,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-01 17:50:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:47,831 INFO L225 Difference]: With dead ends: 64828 [2018-12-01 17:50:47,832 INFO L226 Difference]: Without dead ends: 64668 [2018-12-01 17:50:47,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:50:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2018-12-01 17:50:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2018-12-01 17:50:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2018-12-01 17:50:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2018-12-01 17:50:48,596 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2018-12-01 17:50:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:48,598 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2018-12-01 17:50:48,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2018-12-01 17:50:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 17:50:48,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:48,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:48,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:48,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2018-12-01 17:50:48,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:48,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:48,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:48,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:48,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:50:48,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:50:48,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:50:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:48,652 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2018-12-01 17:50:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:48,702 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2018-12-01 17:50:48,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:50:48,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-01 17:50:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:48,722 INFO L225 Difference]: With dead ends: 12362 [2018-12-01 17:50:48,722 INFO L226 Difference]: Without dead ends: 11841 [2018-12-01 17:50:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2018-12-01 17:50:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2018-12-01 17:50:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2018-12-01 17:50:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2018-12-01 17:50:48,855 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2018-12-01 17:50:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:48,856 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2018-12-01 17:50:48,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:50:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2018-12-01 17:50:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 17:50:48,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:48,858 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] [2018-12-01 17:50:48,859 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:48,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:48,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1845292501, now seen corresponding path program 1 times [2018-12-01 17:50:48,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:48,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:48,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:48,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:48,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:50:48,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:50:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:50:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:48,923 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2018-12-01 17:50:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:49,073 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2018-12-01 17:50:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:50:49,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-01 17:50:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:49,094 INFO L225 Difference]: With dead ends: 17017 [2018-12-01 17:50:49,094 INFO L226 Difference]: Without dead ends: 17017 [2018-12-01 17:50:49,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2018-12-01 17:50:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2018-12-01 17:50:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2018-12-01 17:50:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2018-12-01 17:50:49,285 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2018-12-01 17:50:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:49,286 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2018-12-01 17:50:49,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:50:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2018-12-01 17:50:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-01 17:50:49,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:49,291 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] [2018-12-01 17:50:49,291 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:49,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:49,291 INFO L82 PathProgramCache]: Analyzing trace with hash -169488919, now seen corresponding path program 1 times [2018-12-01 17:50:49,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:49,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:49,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:49,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:49,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:49,355 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 6 states. [2018-12-01 17:50:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:49,779 INFO L93 Difference]: Finished difference Result 18597 states and 60828 transitions. [2018-12-01 17:50:49,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:50:49,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-01 17:50:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:49,799 INFO L225 Difference]: With dead ends: 18597 [2018-12-01 17:50:49,799 INFO L226 Difference]: Without dead ends: 18565 [2018-12-01 17:50:49,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-01 17:50:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2018-12-01 17:50:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 14409. [2018-12-01 17:50:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14409 states. [2018-12-01 17:50:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 47547 transitions. [2018-12-01 17:50:49,970 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 47547 transitions. Word has length 56 [2018-12-01 17:50:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:49,970 INFO L480 AbstractCegarLoop]: Abstraction has 14409 states and 47547 transitions. [2018-12-01 17:50:49,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 47547 transitions. [2018-12-01 17:50:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 17:50:49,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:49,981 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] [2018-12-01 17:50:49,981 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:49,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 860313174, now seen corresponding path program 1 times [2018-12-01 17:50:49,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:49,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:49,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:49,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:50,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:50,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:50,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:50,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:50,074 INFO L87 Difference]: Start difference. First operand 14409 states and 47547 transitions. Second operand 7 states. [2018-12-01 17:50:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:51,144 INFO L93 Difference]: Finished difference Result 49866 states and 161886 transitions. [2018-12-01 17:50:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 17:50:51,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-01 17:50:51,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:51,213 INFO L225 Difference]: With dead ends: 49866 [2018-12-01 17:50:51,214 INFO L226 Difference]: Without dead ends: 49594 [2018-12-01 17:50:51,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-01 17:50:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49594 states. [2018-12-01 17:50:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49594 to 22262. [2018-12-01 17:50:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22262 states. [2018-12-01 17:50:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22262 states to 22262 states and 72740 transitions. [2018-12-01 17:50:51,699 INFO L78 Accepts]: Start accepts. Automaton has 22262 states and 72740 transitions. Word has length 70 [2018-12-01 17:50:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:51,700 INFO L480 AbstractCegarLoop]: Abstraction has 22262 states and 72740 transitions. [2018-12-01 17:50:51,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 22262 states and 72740 transitions. [2018-12-01 17:50:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-01 17:50:51,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:51,714 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] [2018-12-01 17:50:51,714 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2081344425, now seen corresponding path program 1 times [2018-12-01 17:50:51,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:51,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:51,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:51,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:51,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:51,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:51,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:51,771 INFO L87 Difference]: Start difference. First operand 22262 states and 72740 transitions. Second operand 5 states. [2018-12-01 17:50:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:51,794 INFO L93 Difference]: Finished difference Result 4734 states and 12518 transitions. [2018-12-01 17:50:51,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:50:51,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-01 17:50:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:51,798 INFO L225 Difference]: With dead ends: 4734 [2018-12-01 17:50:51,798 INFO L226 Difference]: Without dead ends: 3910 [2018-12-01 17:50:51,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2018-12-01 17:50:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3410. [2018-12-01 17:50:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2018-12-01 17:50:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9066 transitions. [2018-12-01 17:50:51,826 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9066 transitions. Word has length 70 [2018-12-01 17:50:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:51,826 INFO L480 AbstractCegarLoop]: Abstraction has 3410 states and 9066 transitions. [2018-12-01 17:50:51,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9066 transitions. [2018-12-01 17:50:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 17:50:51,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:51,830 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] [2018-12-01 17:50:51,830 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:51,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 583358504, now seen corresponding path program 1 times [2018-12-01 17:50:51,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:51,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:51,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 17:50:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 17:50:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 17:50:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:50:51,852 INFO L87 Difference]: Start difference. First operand 3410 states and 9066 transitions. Second operand 3 states. [2018-12-01 17:50:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:51,926 INFO L93 Difference]: Finished difference Result 3508 states and 9283 transitions. [2018-12-01 17:50:51,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 17:50:51,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-01 17:50:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:51,928 INFO L225 Difference]: With dead ends: 3508 [2018-12-01 17:50:51,929 INFO L226 Difference]: Without dead ends: 3508 [2018-12-01 17:50:51,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 17:50:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2018-12-01 17:50:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3448. [2018-12-01 17:50:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2018-12-01 17:50:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 9152 transitions. [2018-12-01 17:50:51,953 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 9152 transitions. Word has length 89 [2018-12-01 17:50:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:51,954 INFO L480 AbstractCegarLoop]: Abstraction has 3448 states and 9152 transitions. [2018-12-01 17:50:51,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 17:50:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 9152 transitions. [2018-12-01 17:50:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 17:50:51,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:51,959 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] [2018-12-01 17:50:51,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:51,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash -549832089, now seen corresponding path program 1 times [2018-12-01 17:50:51,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:51,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:51,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:51,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:51,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:50:51,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:50:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:50:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:51,996 INFO L87 Difference]: Start difference. First operand 3448 states and 9152 transitions. Second operand 4 states. [2018-12-01 17:50:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:52,141 INFO L93 Difference]: Finished difference Result 4895 states and 13030 transitions. [2018-12-01 17:50:52,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:50:52,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-01 17:50:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:52,145 INFO L225 Difference]: With dead ends: 4895 [2018-12-01 17:50:52,145 INFO L226 Difference]: Without dead ends: 4895 [2018-12-01 17:50:52,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-12-01 17:50:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 3488. [2018-12-01 17:50:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2018-12-01 17:50:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9242 transitions. [2018-12-01 17:50:52,172 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9242 transitions. Word has length 89 [2018-12-01 17:50:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:52,172 INFO L480 AbstractCegarLoop]: Abstraction has 3488 states and 9242 transitions. [2018-12-01 17:50:52,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:50:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9242 transitions. [2018-12-01 17:50:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 17:50:52,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:52,175 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] [2018-12-01 17:50:52,175 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:52,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1688964463, now seen corresponding path program 2 times [2018-12-01 17:50:52,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:52,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:52,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:52,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:52,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:52,203 INFO L87 Difference]: Start difference. First operand 3488 states and 9242 transitions. Second operand 5 states. [2018-12-01 17:50:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:52,353 INFO L93 Difference]: Finished difference Result 4960 states and 12809 transitions. [2018-12-01 17:50:52,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 17:50:52,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-01 17:50:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:52,356 INFO L225 Difference]: With dead ends: 4960 [2018-12-01 17:50:52,356 INFO L226 Difference]: Without dead ends: 4960 [2018-12-01 17:50:52,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2018-12-01 17:50:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4173. [2018-12-01 17:50:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2018-12-01 17:50:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 10939 transitions. [2018-12-01 17:50:52,386 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 10939 transitions. Word has length 89 [2018-12-01 17:50:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:52,386 INFO L480 AbstractCegarLoop]: Abstraction has 4173 states and 10939 transitions. [2018-12-01 17:50:52,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 10939 transitions. [2018-12-01 17:50:52,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 17:50:52,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:52,389 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:52,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1929956275, now seen corresponding path program 3 times [2018-12-01 17:50:52,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:52,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:52,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:50:52,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:52,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:52,440 INFO L87 Difference]: Start difference. First operand 4173 states and 10939 transitions. Second operand 7 states. [2018-12-01 17:50:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:52,671 INFO L93 Difference]: Finished difference Result 5187 states and 13337 transitions. [2018-12-01 17:50:52,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:50:52,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-01 17:50:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:52,675 INFO L225 Difference]: With dead ends: 5187 [2018-12-01 17:50:52,675 INFO L226 Difference]: Without dead ends: 5108 [2018-12-01 17:50:52,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:50:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2018-12-01 17:50:52,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4355. [2018-12-01 17:50:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-12-01 17:50:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 11357 transitions. [2018-12-01 17:50:52,706 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 11357 transitions. Word has length 89 [2018-12-01 17:50:52,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:52,706 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 11357 transitions. [2018-12-01 17:50:52,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 11357 transitions. [2018-12-01 17:50:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-01 17:50:52,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:52,709 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] [2018-12-01 17:50:52,709 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:52,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash 40983182, now seen corresponding path program 1 times [2018-12-01 17:50:52,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:52,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:50:52,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:52,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:52,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:52,745 INFO L87 Difference]: Start difference. First operand 4355 states and 11357 transitions. Second operand 5 states. [2018-12-01 17:50:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:52,856 INFO L93 Difference]: Finished difference Result 5801 states and 14770 transitions. [2018-12-01 17:50:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 17:50:52,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-01 17:50:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:52,860 INFO L225 Difference]: With dead ends: 5801 [2018-12-01 17:50:52,860 INFO L226 Difference]: Without dead ends: 5737 [2018-12-01 17:50:52,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:50:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2018-12-01 17:50:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 4437. [2018-12-01 17:50:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2018-12-01 17:50:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 11528 transitions. [2018-12-01 17:50:52,897 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 11528 transitions. Word has length 89 [2018-12-01 17:50:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:52,898 INFO L480 AbstractCegarLoop]: Abstraction has 4437 states and 11528 transitions. [2018-12-01 17:50:52,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 11528 transitions. [2018-12-01 17:50:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:52,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:52,901 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] [2018-12-01 17:50:52,901 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:52,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1540346686, now seen corresponding path program 1 times [2018-12-01 17:50:52,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:52,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:52,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:52,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 17:50:52,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 17:50:52,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 17:50:52,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:52,930 INFO L87 Difference]: Start difference. First operand 4437 states and 11528 transitions. Second operand 4 states. [2018-12-01 17:50:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:53,018 INFO L93 Difference]: Finished difference Result 7785 states and 20394 transitions. [2018-12-01 17:50:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:50:53,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-01 17:50:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:53,025 INFO L225 Difference]: With dead ends: 7785 [2018-12-01 17:50:53,025 INFO L226 Difference]: Without dead ends: 7757 [2018-12-01 17:50:53,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 17:50:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2018-12-01 17:50:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 4179. [2018-12-01 17:50:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-12-01 17:50:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10785 transitions. [2018-12-01 17:50:53,068 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10785 transitions. Word has length 91 [2018-12-01 17:50:53,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:53,068 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10785 transitions. [2018-12-01 17:50:53,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 17:50:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10785 transitions. [2018-12-01 17:50:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:53,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:53,071 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] [2018-12-01 17:50:53,072 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:53,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash -162033363, now seen corresponding path program 1 times [2018-12-01 17:50:53,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:53,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:53,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:53,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:53,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:53,131 INFO L87 Difference]: Start difference. First operand 4179 states and 10785 transitions. Second operand 6 states. [2018-12-01 17:50:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:53,292 INFO L93 Difference]: Finished difference Result 4586 states and 11717 transitions. [2018-12-01 17:50:53,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:50:53,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 17:50:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:53,296 INFO L225 Difference]: With dead ends: 4586 [2018-12-01 17:50:53,296 INFO L226 Difference]: Without dead ends: 4586 [2018-12-01 17:50:53,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2018-12-01 17:50:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4232. [2018-12-01 17:50:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-12-01 17:50:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 10914 transitions. [2018-12-01 17:50:53,329 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 10914 transitions. Word has length 91 [2018-12-01 17:50:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:53,329 INFO L480 AbstractCegarLoop]: Abstraction has 4232 states and 10914 transitions. [2018-12-01 17:50:53,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 10914 transitions. [2018-12-01 17:50:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:53,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:53,333 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] [2018-12-01 17:50:53,333 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:53,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 807547660, now seen corresponding path program 1 times [2018-12-01 17:50:53,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:53,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:53,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:53,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:53,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:53,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:53,401 INFO L87 Difference]: Start difference. First operand 4232 states and 10914 transitions. Second operand 6 states. [2018-12-01 17:50:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:53,554 INFO L93 Difference]: Finished difference Result 6106 states and 15541 transitions. [2018-12-01 17:50:53,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:50:53,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 17:50:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:53,560 INFO L225 Difference]: With dead ends: 6106 [2018-12-01 17:50:53,560 INFO L226 Difference]: Without dead ends: 6074 [2018-12-01 17:50:53,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2018-12-01 17:50:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 4851. [2018-12-01 17:50:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2018-12-01 17:50:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 12449 transitions. [2018-12-01 17:50:53,609 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 12449 transitions. Word has length 91 [2018-12-01 17:50:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:53,609 INFO L480 AbstractCegarLoop]: Abstraction has 4851 states and 12449 transitions. [2018-12-01 17:50:53,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 12449 transitions. [2018-12-01 17:50:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:53,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:53,614 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] [2018-12-01 17:50:53,614 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:53,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1769161677, now seen corresponding path program 1 times [2018-12-01 17:50:53,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:53,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:53,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:53,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:53,681 INFO L87 Difference]: Start difference. First operand 4851 states and 12449 transitions. Second operand 7 states. [2018-12-01 17:50:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:53,953 INFO L93 Difference]: Finished difference Result 9774 states and 25388 transitions. [2018-12-01 17:50:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 17:50:53,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 17:50:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:53,961 INFO L225 Difference]: With dead ends: 9774 [2018-12-01 17:50:53,961 INFO L226 Difference]: Without dead ends: 9774 [2018-12-01 17:50:53,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-01 17:50:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2018-12-01 17:50:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 5475. [2018-12-01 17:50:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5475 states. [2018-12-01 17:50:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 14083 transitions. [2018-12-01 17:50:54,039 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 14083 transitions. Word has length 91 [2018-12-01 17:50:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:54,039 INFO L480 AbstractCegarLoop]: Abstraction has 5475 states and 14083 transitions. [2018-12-01 17:50:54,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 14083 transitions. [2018-12-01 17:50:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:54,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:54,045 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] [2018-12-01 17:50:54,045 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1281041138, now seen corresponding path program 1 times [2018-12-01 17:50:54,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:54,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:54,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:54,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:54,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:54,143 INFO L87 Difference]: Start difference. First operand 5475 states and 14083 transitions. Second operand 7 states. [2018-12-01 17:50:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:54,385 INFO L93 Difference]: Finished difference Result 5137 states and 13135 transitions. [2018-12-01 17:50:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 17:50:54,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 17:50:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:54,388 INFO L225 Difference]: With dead ends: 5137 [2018-12-01 17:50:54,388 INFO L226 Difference]: Without dead ends: 5137 [2018-12-01 17:50:54,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-01 17:50:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2018-12-01 17:50:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4996. [2018-12-01 17:50:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2018-12-01 17:50:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 12823 transitions. [2018-12-01 17:50:54,422 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 12823 transitions. Word has length 91 [2018-12-01 17:50:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:54,422 INFO L480 AbstractCegarLoop]: Abstraction has 4996 states and 12823 transitions. [2018-12-01 17:50:54,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 12823 transitions. [2018-12-01 17:50:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:54,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:54,426 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] [2018-12-01 17:50:54,426 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:54,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1672445698, now seen corresponding path program 1 times [2018-12-01 17:50:54,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:54,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:54,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:54,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:54,472 INFO L87 Difference]: Start difference. First operand 4996 states and 12823 transitions. Second operand 7 states. [2018-12-01 17:50:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:54,618 INFO L93 Difference]: Finished difference Result 5446 states and 13900 transitions. [2018-12-01 17:50:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:50:54,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-01 17:50:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:54,624 INFO L225 Difference]: With dead ends: 5446 [2018-12-01 17:50:54,624 INFO L226 Difference]: Without dead ends: 5446 [2018-12-01 17:50:54,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2018-12-01 17:50:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 5036. [2018-12-01 17:50:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2018-12-01 17:50:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 12894 transitions. [2018-12-01 17:50:54,669 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 12894 transitions. Word has length 91 [2018-12-01 17:50:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:54,669 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 12894 transitions. [2018-12-01 17:50:54,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 12894 transitions. [2018-12-01 17:50:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:54,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:54,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:54,673 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:54,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1439174301, now seen corresponding path program 1 times [2018-12-01 17:50:54,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:54,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:54,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:54,736 INFO L87 Difference]: Start difference. First operand 5036 states and 12894 transitions. Second operand 5 states. [2018-12-01 17:50:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:54,831 INFO L93 Difference]: Finished difference Result 4529 states and 11631 transitions. [2018-12-01 17:50:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 17:50:54,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-01 17:50:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:54,834 INFO L225 Difference]: With dead ends: 4529 [2018-12-01 17:50:54,834 INFO L226 Difference]: Without dead ends: 4529 [2018-12-01 17:50:54,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2018-12-01 17:50:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4491. [2018-12-01 17:50:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-12-01 17:50:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 11554 transitions. [2018-12-01 17:50:54,863 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 11554 transitions. Word has length 91 [2018-12-01 17:50:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:54,863 INFO L480 AbstractCegarLoop]: Abstraction has 4491 states and 11554 transitions. [2018-12-01 17:50:54,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 11554 transitions. [2018-12-01 17:50:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-01 17:50:54,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:54,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] [2018-12-01 17:50:54,866 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:54,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -347029090, now seen corresponding path program 1 times [2018-12-01 17:50:54,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:54,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:54,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:54,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:54,917 INFO L87 Difference]: Start difference. First operand 4491 states and 11554 transitions. Second operand 6 states. [2018-12-01 17:50:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:54,971 INFO L93 Difference]: Finished difference Result 4075 states and 10146 transitions. [2018-12-01 17:50:54,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 17:50:54,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-01 17:50:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:54,974 INFO L225 Difference]: With dead ends: 4075 [2018-12-01 17:50:54,974 INFO L226 Difference]: Without dead ends: 4075 [2018-12-01 17:50:54,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-12-01 17:50:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2421. [2018-12-01 17:50:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2018-12-01 17:50:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 6211 transitions. [2018-12-01 17:50:54,995 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 6211 transitions. Word has length 91 [2018-12-01 17:50:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:54,995 INFO L480 AbstractCegarLoop]: Abstraction has 2421 states and 6211 transitions. [2018-12-01 17:50:54,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 6211 transitions. [2018-12-01 17:50:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:54,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:54,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:54,997 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:54,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:54,997 INFO L82 PathProgramCache]: Analyzing trace with hash -626984130, now seen corresponding path program 1 times [2018-12-01 17:50:54,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:54,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:54,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:55,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:55,039 INFO L87 Difference]: Start difference. First operand 2421 states and 6211 transitions. Second operand 7 states. [2018-12-01 17:50:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:55,298 INFO L93 Difference]: Finished difference Result 3893 states and 9716 transitions. [2018-12-01 17:50:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 17:50:55,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 17:50:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:55,301 INFO L225 Difference]: With dead ends: 3893 [2018-12-01 17:50:55,301 INFO L226 Difference]: Without dead ends: 3861 [2018-12-01 17:50:55,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:50:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-12-01 17:50:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3073. [2018-12-01 17:50:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-12-01 17:50:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 7791 transitions. [2018-12-01 17:50:55,323 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 7791 transitions. Word has length 93 [2018-12-01 17:50:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:55,323 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 7791 transitions. [2018-12-01 17:50:55,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 7791 transitions. [2018-12-01 17:50:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:55,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:55,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:55,325 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:55,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 617780351, now seen corresponding path program 1 times [2018-12-01 17:50:55,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:55,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:55,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:55,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:55,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:55,368 INFO L87 Difference]: Start difference. First operand 3073 states and 7791 transitions. Second operand 6 states. [2018-12-01 17:50:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:55,440 INFO L93 Difference]: Finished difference Result 3123 states and 7833 transitions. [2018-12-01 17:50:55,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 17:50:55,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 17:50:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:55,442 INFO L225 Difference]: With dead ends: 3123 [2018-12-01 17:50:55,442 INFO L226 Difference]: Without dead ends: 3123 [2018-12-01 17:50:55,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 17:50:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2018-12-01 17:50:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3043. [2018-12-01 17:50:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-12-01 17:50:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 7679 transitions. [2018-12-01 17:50:55,463 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 7679 transitions. Word has length 93 [2018-12-01 17:50:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:55,463 INFO L480 AbstractCegarLoop]: Abstraction has 3043 states and 7679 transitions. [2018-12-01 17:50:55,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 7679 transitions. [2018-12-01 17:50:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:55,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:55,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:55,465 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:55,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash -297218369, now seen corresponding path program 1 times [2018-12-01 17:50:55,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:55,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:55,510 INFO L87 Difference]: Start difference. First operand 3043 states and 7679 transitions. Second operand 6 states. [2018-12-01 17:50:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:55,649 INFO L93 Difference]: Finished difference Result 3582 states and 8908 transitions. [2018-12-01 17:50:55,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 17:50:55,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 17:50:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:55,651 INFO L225 Difference]: With dead ends: 3582 [2018-12-01 17:50:55,652 INFO L226 Difference]: Without dead ends: 3582 [2018-12-01 17:50:55,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 17:50:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2018-12-01 17:50:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3082. [2018-12-01 17:50:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-01 17:50:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7728 transitions. [2018-12-01 17:50:55,675 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7728 transitions. Word has length 93 [2018-12-01 17:50:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:55,675 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7728 transitions. [2018-12-01 17:50:55,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7728 transitions. [2018-12-01 17:50:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:55,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:55,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:55,678 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1093073861, now seen corresponding path program 2 times [2018-12-01 17:50:55,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:55,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:55,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:55,722 INFO L87 Difference]: Start difference. First operand 3082 states and 7728 transitions. Second operand 7 states. [2018-12-01 17:50:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:55,871 INFO L93 Difference]: Finished difference Result 3099 states and 7760 transitions. [2018-12-01 17:50:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 17:50:55,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 17:50:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:55,873 INFO L225 Difference]: With dead ends: 3099 [2018-12-01 17:50:55,873 INFO L226 Difference]: Without dead ends: 3099 [2018-12-01 17:50:55,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-01 17:50:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2018-12-01 17:50:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3082. [2018-12-01 17:50:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-01 17:50:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7725 transitions. [2018-12-01 17:50:55,893 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7725 transitions. Word has length 93 [2018-12-01 17:50:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:55,893 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7725 transitions. [2018-12-01 17:50:55,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7725 transitions. [2018-12-01 17:50:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:55,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:55,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:55,895 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:55,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1409070332, now seen corresponding path program 1 times [2018-12-01 17:50:55,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:50:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:55,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:55,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:55,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:55,940 INFO L87 Difference]: Start difference. First operand 3082 states and 7725 transitions. Second operand 7 states. [2018-12-01 17:50:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:56,100 INFO L93 Difference]: Finished difference Result 4056 states and 10447 transitions. [2018-12-01 17:50:56,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 17:50:56,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 17:50:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:56,103 INFO L225 Difference]: With dead ends: 4056 [2018-12-01 17:50:56,103 INFO L226 Difference]: Without dead ends: 4056 [2018-12-01 17:50:56,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-01 17:50:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2018-12-01 17:50:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2458. [2018-12-01 17:50:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2018-12-01 17:50:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 6206 transitions. [2018-12-01 17:50:56,123 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 6206 transitions. Word has length 93 [2018-12-01 17:50:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:56,124 INFO L480 AbstractCegarLoop]: Abstraction has 2458 states and 6206 transitions. [2018-12-01 17:50:56,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 6206 transitions. [2018-12-01 17:50:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:56,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:56,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:56,125 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:56,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash 494071612, now seen corresponding path program 1 times [2018-12-01 17:50:56,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:56,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:56,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 17:50:56,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 17:50:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 17:50:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 17:50:56,157 INFO L87 Difference]: Start difference. First operand 2458 states and 6206 transitions. Second operand 5 states. [2018-12-01 17:50:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:56,248 INFO L93 Difference]: Finished difference Result 2810 states and 7070 transitions. [2018-12-01 17:50:56,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:50:56,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-01 17:50:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:56,250 INFO L225 Difference]: With dead ends: 2810 [2018-12-01 17:50:56,250 INFO L226 Difference]: Without dead ends: 2778 [2018-12-01 17:50:56,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-12-01 17:50:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2506. [2018-12-01 17:50:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-12-01 17:50:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6310 transitions. [2018-12-01 17:50:56,269 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6310 transitions. Word has length 93 [2018-12-01 17:50:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:56,269 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 6310 transitions. [2018-12-01 17:50:56,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 17:50:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6310 transitions. [2018-12-01 17:50:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:56,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:56,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:56,271 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:56,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1738836093, now seen corresponding path program 1 times [2018-12-01 17:50:56,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:56,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:56,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:56,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 17:50:56,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 17:50:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 17:50:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:56,350 INFO L87 Difference]: Start difference. First operand 2506 states and 6310 transitions. Second operand 7 states. [2018-12-01 17:50:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:56,499 INFO L93 Difference]: Finished difference Result 4157 states and 10693 transitions. [2018-12-01 17:50:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 17:50:56,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-01 17:50:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:56,500 INFO L225 Difference]: With dead ends: 4157 [2018-12-01 17:50:56,501 INFO L226 Difference]: Without dead ends: 1726 [2018-12-01 17:50:56,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-01 17:50:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-12-01 17:50:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2018-12-01 17:50:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-12-01 17:50:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4513 transitions. [2018-12-01 17:50:56,512 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4513 transitions. Word has length 93 [2018-12-01 17:50:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:56,512 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 4513 transitions. [2018-12-01 17:50:56,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 17:50:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4513 transitions. [2018-12-01 17:50:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:56,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:56,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:56,513 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:56,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1752144950, now seen corresponding path program 1 times [2018-12-01 17:50:56,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:56,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:56,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:56,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 17:50:56,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 17:50:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 17:50:56,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 17:50:56,564 INFO L87 Difference]: Start difference. First operand 1726 states and 4513 transitions. Second operand 6 states. [2018-12-01 17:50:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:56,632 INFO L93 Difference]: Finished difference Result 1812 states and 4666 transitions. [2018-12-01 17:50:56,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 17:50:56,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-01 17:50:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:56,634 INFO L225 Difference]: With dead ends: 1812 [2018-12-01 17:50:56,634 INFO L226 Difference]: Without dead ends: 1792 [2018-12-01 17:50:56,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 17:50:56,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-12-01 17:50:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1718. [2018-12-01 17:50:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-12-01 17:50:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4487 transitions. [2018-12-01 17:50:56,646 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 4487 transitions. Word has length 93 [2018-12-01 17:50:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:56,646 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 4487 transitions. [2018-12-01 17:50:56,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 17:50:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 4487 transitions. [2018-12-01 17:50:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:56,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:56,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:56,648 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:56,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 2 times [2018-12-01 17:50:56,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:50:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:50:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:50:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:50:56,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 17:50:56,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 17:50:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 17:50:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 17:50:56,748 INFO L87 Difference]: Start difference. First operand 1718 states and 4487 transitions. Second operand 12 states. [2018-12-01 17:50:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:50:57,055 INFO L93 Difference]: Finished difference Result 3315 states and 8720 transitions. [2018-12-01 17:50:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 17:50:57,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-01 17:50:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 17:50:57,057 INFO L225 Difference]: With dead ends: 3315 [2018-12-01 17:50:57,057 INFO L226 Difference]: Without dead ends: 2339 [2018-12-01 17:50:57,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-01 17:50:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2018-12-01 17:50:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2018-12-01 17:50:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-12-01 17:50:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5546 transitions. [2018-12-01 17:50:57,072 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5546 transitions. Word has length 93 [2018-12-01 17:50:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 17:50:57,072 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 5546 transitions. [2018-12-01 17:50:57,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 17:50:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5546 transitions. [2018-12-01 17:50:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-01 17:50:57,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 17:50:57,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:50:57,073 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 17:50:57,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:50:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1369725745, now seen corresponding path program 3 times [2018-12-01 17:50:57,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:50:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:50:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:57,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:50:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:50:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:50:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:50:57,126 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 17:50:57,195 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 17:50:57,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 05:50:57 BasicIcfg [2018-12-01 17:50:57,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 17:50:57,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:50:57,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:50:57,197 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:50:57,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:50:44" (3/4) ... [2018-12-01 17:50:57,199 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 17:50:57,266 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d9f23237-025d-449e-9a3c-52e267028c17/bin-2019/uautomizer/witness.graphml [2018-12-01 17:50:57,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:50:57,267 INFO L168 Benchmark]: Toolchain (without parser) took 13382.47 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 957.1 MB in the beginning and 676.3 MB in the end (delta: 280.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,268 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:50:57,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,269 INFO L168 Benchmark]: Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:50:57,269 INFO L168 Benchmark]: RCFGBuilder took 349.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,269 INFO L168 Benchmark]: TraceAbstraction took 12561.29 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 688.7 MB in the end (delta: 364.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,269 INFO L168 Benchmark]: Witness Printer took 69.76 ms. Allocated memory is still 2.3 GB. Free memory was 688.7 MB in the beginning and 676.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:50:57,271 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 349.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12561.29 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 688.7 MB in the end (delta: 364.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 69.76 ms. Allocated memory is still 2.3 GB. Free memory was 688.7 MB in the beginning and 676.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2478; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 12.4s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6365 SDtfs, 6378 SDslu, 13421 SDs, 0 SdLazy, 6051 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 91 SyntacticMatches, 13 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 100107 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2475 NumberOfCodeBlocks, 2475 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2353 ConstructedInterpolants, 0 QuantifiedInterpolants, 491429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...