./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_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_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 19:35:19,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:35:19,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:35:19,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:35:19,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:35:19,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:35:19,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:35:19,391 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:35:19,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:35:19,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:35:19,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:35:19,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:35:19,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:35:19,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:35:19,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:35:19,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:35:19,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:35:19,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:35:19,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:35:19,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:35:19,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:35:19,403 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:35:19,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:35:19,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:35:19,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:35:19,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:35:19,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:35:19,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:35:19,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:35:19,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:35:19,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:35:19,408 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:35:19,408 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:35:19,409 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:35:19,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:35:19,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:35:19,410 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:35:19,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:35:19,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:35:19,418 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:35:19,418 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:35:19,418 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:35:19,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:35:19,418 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:35:19,419 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:35:19,420 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:35:19,420 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:35:19,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:35:19,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:35:19,421 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:35:19,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:35:19,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:35:19,422 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:35:19,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:35:19,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:35:19,423 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:35:19,423 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan 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 -> Taipan 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 -> c1f9c3d1c44dc25378b363cd225ab320ff5e52b6 [2018-12-09 19:35:19,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:35:19,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:35:19,449 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:35:19,450 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:35:19,450 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:35:19,450 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-12-09 19:35:19,486 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/data/81212c6dc/c90a3dd2d6d345f6ae49fe71a26c351f/FLAG5eb19b954 [2018-12-09 19:35:19,843 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:35:19,844 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/sv-benchmarks/c/pthread-wmm/rfi001_pso.oepc_false-unreach-call.i [2018-12-09 19:35:19,850 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/data/81212c6dc/c90a3dd2d6d345f6ae49fe71a26c351f/FLAG5eb19b954 [2018-12-09 19:35:19,859 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/data/81212c6dc/c90a3dd2d6d345f6ae49fe71a26c351f [2018-12-09 19:35:19,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:35:19,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:35:19,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:19,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:35:19,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:35:19,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:19" (1/1) ... [2018-12-09 19:35:19,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7240a955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:19, skipping insertion in model container [2018-12-09 19:35:19,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:19" (1/1) ... [2018-12-09 19:35:19,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:35:19,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:35:20,091 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:20,101 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:35:20,189 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:35:20,223 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:35:20,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20 WrapperNode [2018-12-09 19:35:20,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:35:20,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:20,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:35:20,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:35:20,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:35:20,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:35:20,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:35:20,263 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:35:20,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... [2018-12-09 19:35:20,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:35:20,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:35:20,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:35:20,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:35:20,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/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-09 19:35:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:35:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:35:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:35:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:35:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:35:20,319 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:35:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:35:20,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:35:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:35:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:35:20,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:35:20,321 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:35:20,617 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:35:20,617 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:35:20,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:20 BoogieIcfgContainer [2018-12-09 19:35:20,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:35:20,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:35:20,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:35:20,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:35:20,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:35:19" (1/3) ... [2018-12-09 19:35:20,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5d8999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:20, skipping insertion in model container [2018-12-09 19:35:20,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:20" (2/3) ... [2018-12-09 19:35:20,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5d8999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:20, skipping insertion in model container [2018-12-09 19:35:20,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:20" (3/3) ... [2018-12-09 19:35:20,623 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc_false-unreach-call.i [2018-12-09 19:35:20,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,646 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,646 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,646 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,646 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,647 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,647 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,647 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,648 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,651 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,655 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,656 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,657 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,658 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,659 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,665 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,666 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,667 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,668 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,669 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:35:20,672 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:35:20,673 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:35:20,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:35:20,688 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:35:20,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:35:20,704 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:35:20,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:35:20,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:35:20,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:35:20,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:35:20,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:35:20,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:35:20,712 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 19:35:22,279 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 19:35:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 19:35:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 19:35:22,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:22,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:22,287 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:22,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-09 19:35:22,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:22,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:22,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:22,442 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-09 19:35:22,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:22,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:22,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:22,457 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 19:35:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:22,971 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 19:35:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:22,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 19:35:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:23,134 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 19:35:23,134 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 19:35:23,135 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-09 19:35:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 19:35:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 19:35:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 19:35:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 19:35:23,885 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 19:35:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:23,885 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 19:35:23,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 19:35:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:35:23,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:23,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:23,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:23,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-09 19:35:23,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:23,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:35:23,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:23,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:23,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:23,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:23,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:23,929 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-09 19:35:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:24,049 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-09 19:35:24,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:24,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 19:35:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:24,104 INFO L225 Difference]: With dead ends: 27339 [2018-12-09 19:35:24,105 INFO L226 Difference]: Without dead ends: 27339 [2018-12-09 19:35:24,105 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-09 19:35:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-09 19:35:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-09 19:35:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 19:35:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-09 19:35:24,594 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-09 19:35:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:24,595 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-09 19:35:24,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-09 19:35:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:35:24,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:24,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:24,597 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:24,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-09 19:35:24,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:24,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:24,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:24,644 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-09 19:35:24,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:24,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:24,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:24,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:24,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:24,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:24,645 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 4 states. [2018-12-09 19:35:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:24,683 INFO L93 Difference]: Finished difference Result 8529 states and 28321 transitions. [2018-12-09 19:35:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:24,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 19:35:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:24,693 INFO L225 Difference]: With dead ends: 8529 [2018-12-09 19:35:24,693 INFO L226 Difference]: Without dead ends: 7467 [2018-12-09 19:35:24,694 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-09 19:35:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2018-12-09 19:35:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7467. [2018-12-09 19:35:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7467 states. [2018-12-09 19:35:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7467 states to 7467 states and 24613 transitions. [2018-12-09 19:35:24,777 INFO L78 Accepts]: Start accepts. Automaton has 7467 states and 24613 transitions. Word has length 46 [2018-12-09 19:35:24,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:24,777 INFO L480 AbstractCegarLoop]: Abstraction has 7467 states and 24613 transitions. [2018-12-09 19:35:24,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7467 states and 24613 transitions. [2018-12-09 19:35:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:35:24,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:24,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:24,778 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:24,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-09 19:35:24,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:24,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:24,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:24,822 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-09 19:35:24,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:24,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:24,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:24,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:24,823 INFO L87 Difference]: Start difference. First operand 7467 states and 24613 transitions. Second operand 5 states. [2018-12-09 19:35:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:24,993 INFO L93 Difference]: Finished difference Result 13999 states and 45774 transitions. [2018-12-09 19:35:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:24,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 19:35:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:25,010 INFO L225 Difference]: With dead ends: 13999 [2018-12-09 19:35:25,010 INFO L226 Difference]: Without dead ends: 13931 [2018-12-09 19:35:25,010 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-09 19:35:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2018-12-09 19:35:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 9442. [2018-12-09 19:35:25,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9442 states. [2018-12-09 19:35:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9442 states to 9442 states and 30519 transitions. [2018-12-09 19:35:25,127 INFO L78 Accepts]: Start accepts. Automaton has 9442 states and 30519 transitions. Word has length 47 [2018-12-09 19:35:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:25,128 INFO L480 AbstractCegarLoop]: Abstraction has 9442 states and 30519 transitions. [2018-12-09 19:35:25,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9442 states and 30519 transitions. [2018-12-09 19:35:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:35:25,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:25,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:25,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:25,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-09 19:35:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:25,153 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-09 19:35:25,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:25,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:25,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:25,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:25,154 INFO L87 Difference]: Start difference. First operand 9442 states and 30519 transitions. Second operand 3 states. [2018-12-09 19:35:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:25,215 INFO L93 Difference]: Finished difference Result 13280 states and 42594 transitions. [2018-12-09 19:35:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:25,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 19:35:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:25,233 INFO L225 Difference]: With dead ends: 13280 [2018-12-09 19:35:25,233 INFO L226 Difference]: Without dead ends: 13280 [2018-12-09 19:35:25,234 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-09 19:35:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13280 states. [2018-12-09 19:35:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13280 to 9846. [2018-12-09 19:35:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2018-12-09 19:35:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31485 transitions. [2018-12-09 19:35:25,453 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31485 transitions. Word has length 49 [2018-12-09 19:35:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:25,453 INFO L480 AbstractCegarLoop]: Abstraction has 9846 states and 31485 transitions. [2018-12-09 19:35:25,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31485 transitions. [2018-12-09 19:35:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:35:25,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:25,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:25,455 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:25,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:25,456 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-09 19:35:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:25,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:25,511 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-09 19:35:25,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:25,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:25,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:25,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:25,512 INFO L87 Difference]: Start difference. First operand 9846 states and 31485 transitions. Second operand 6 states. [2018-12-09 19:35:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:25,786 INFO L93 Difference]: Finished difference Result 14204 states and 45033 transitions. [2018-12-09 19:35:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:35:25,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 19:35:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:25,801 INFO L225 Difference]: With dead ends: 14204 [2018-12-09 19:35:25,801 INFO L226 Difference]: Without dead ends: 14132 [2018-12-09 19:35:25,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:35:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14132 states. [2018-12-09 19:35:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14132 to 10850. [2018-12-09 19:35:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10850 states. [2018-12-09 19:35:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 34540 transitions. [2018-12-09 19:35:25,921 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 34540 transitions. Word has length 53 [2018-12-09 19:35:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:25,922 INFO L480 AbstractCegarLoop]: Abstraction has 10850 states and 34540 transitions. [2018-12-09 19:35:25,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 34540 transitions. [2018-12-09 19:35:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:35:25,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:25,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:25,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:25,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-09 19:35:25,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:25,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:25,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:35:25,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:25,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:25,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:25,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:25,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:25,984 INFO L87 Difference]: Start difference. First operand 10850 states and 34540 transitions. Second operand 4 states. [2018-12-09 19:35:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:26,066 INFO L93 Difference]: Finished difference Result 12397 states and 39549 transitions. [2018-12-09 19:35:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:26,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 19:35:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:26,080 INFO L225 Difference]: With dead ends: 12397 [2018-12-09 19:35:26,080 INFO L226 Difference]: Without dead ends: 12397 [2018-12-09 19:35:26,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-12-09 19:35:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 11370. [2018-12-09 19:35:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2018-12-09 19:35:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 36213 transitions. [2018-12-09 19:35:26,195 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 36213 transitions. Word has length 61 [2018-12-09 19:35:26,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:26,195 INFO L480 AbstractCegarLoop]: Abstraction has 11370 states and 36213 transitions. [2018-12-09 19:35:26,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 36213 transitions. [2018-12-09 19:35:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:35:26,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:26,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:26,198 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:26,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-09 19:35:26,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:26,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:26,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:26,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:35:26,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:26,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:26,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:26,245 INFO L87 Difference]: Start difference. First operand 11370 states and 36213 transitions. Second operand 6 states. [2018-12-09 19:35:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:26,509 INFO L93 Difference]: Finished difference Result 20970 states and 66431 transitions. [2018-12-09 19:35:26,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:35:26,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 19:35:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:26,531 INFO L225 Difference]: With dead ends: 20970 [2018-12-09 19:35:26,531 INFO L226 Difference]: Without dead ends: 20899 [2018-12-09 19:35:26,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:35:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2018-12-09 19:35:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 13756. [2018-12-09 19:35:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13756 states. [2018-12-09 19:35:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 43245 transitions. [2018-12-09 19:35:26,776 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 43245 transitions. Word has length 61 [2018-12-09 19:35:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:26,777 INFO L480 AbstractCegarLoop]: Abstraction has 13756 states and 43245 transitions. [2018-12-09 19:35:26,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 43245 transitions. [2018-12-09 19:35:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:35:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:26,780 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] [2018-12-09 19:35:26,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:26,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 593414934, now seen corresponding path program 1 times [2018-12-09 19:35:26,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:26,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:26,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:26,807 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-09 19:35:26,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:26,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:26,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:26,808 INFO L87 Difference]: Start difference. First operand 13756 states and 43245 transitions. Second operand 3 states. [2018-12-09 19:35:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:26,948 INFO L93 Difference]: Finished difference Result 14388 states and 44945 transitions. [2018-12-09 19:35:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:26,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 19:35:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:26,964 INFO L225 Difference]: With dead ends: 14388 [2018-12-09 19:35:26,964 INFO L226 Difference]: Without dead ends: 14388 [2018-12-09 19:35:26,965 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-09 19:35:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14388 states. [2018-12-09 19:35:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14388 to 14072. [2018-12-09 19:35:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14072 states. [2018-12-09 19:35:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 44095 transitions. [2018-12-09 19:35:27,107 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 44095 transitions. Word has length 65 [2018-12-09 19:35:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:27,108 INFO L480 AbstractCegarLoop]: Abstraction has 14072 states and 44095 transitions. [2018-12-09 19:35:27,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 44095 transitions. [2018-12-09 19:35:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:35:27,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:27,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:27,112 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:27,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1624343019, now seen corresponding path program 1 times [2018-12-09 19:35:27,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:27,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:27,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:27,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:27,151 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-09 19:35:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:27,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:27,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:27,152 INFO L87 Difference]: Start difference. First operand 14072 states and 44095 transitions. Second operand 4 states. [2018-12-09 19:35:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:27,327 INFO L93 Difference]: Finished difference Result 17952 states and 55400 transitions. [2018-12-09 19:35:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:27,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 19:35:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:27,346 INFO L225 Difference]: With dead ends: 17952 [2018-12-09 19:35:27,346 INFO L226 Difference]: Without dead ends: 17952 [2018-12-09 19:35:27,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2018-12-09 19:35:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16110. [2018-12-09 19:35:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16110 states. [2018-12-09 19:35:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16110 states to 16110 states and 49946 transitions. [2018-12-09 19:35:27,520 INFO L78 Accepts]: Start accepts. Automaton has 16110 states and 49946 transitions. Word has length 65 [2018-12-09 19:35:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:27,520 INFO L480 AbstractCegarLoop]: Abstraction has 16110 states and 49946 transitions. [2018-12-09 19:35:27,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 16110 states and 49946 transitions. [2018-12-09 19:35:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:27,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:27,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:27,526 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:27,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2018-12-09 19:35:27,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:27,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:27,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:27,572 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-09 19:35:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:27,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:27,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:27,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:27,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:27,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:27,573 INFO L87 Difference]: Start difference. First operand 16110 states and 49946 transitions. Second operand 6 states. [2018-12-09 19:35:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:28,099 INFO L93 Difference]: Finished difference Result 19822 states and 60382 transitions. [2018-12-09 19:35:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:28,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 19:35:28,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:28,119 INFO L225 Difference]: With dead ends: 19822 [2018-12-09 19:35:28,119 INFO L226 Difference]: Without dead ends: 19822 [2018-12-09 19:35:28,120 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-09 19:35:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19822 states. [2018-12-09 19:35:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19822 to 18618. [2018-12-09 19:35:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18618 states. [2018-12-09 19:35:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18618 states to 18618 states and 57170 transitions. [2018-12-09 19:35:28,327 INFO L78 Accepts]: Start accepts. Automaton has 18618 states and 57170 transitions. Word has length 67 [2018-12-09 19:35:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:28,327 INFO L480 AbstractCegarLoop]: Abstraction has 18618 states and 57170 transitions. [2018-12-09 19:35:28,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18618 states and 57170 transitions. [2018-12-09 19:35:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:28,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:28,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:28,335 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2018-12-09 19:35:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:28,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:28,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:28,403 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-09 19:35:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:28,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:28,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:28,404 INFO L87 Difference]: Start difference. First operand 18618 states and 57170 transitions. Second operand 6 states. [2018-12-09 19:35:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:28,692 INFO L93 Difference]: Finished difference Result 21450 states and 63579 transitions. [2018-12-09 19:35:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:35:28,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 19:35:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:28,713 INFO L225 Difference]: With dead ends: 21450 [2018-12-09 19:35:28,713 INFO L226 Difference]: Without dead ends: 21450 [2018-12-09 19:35:28,713 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-09 19:35:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21450 states. [2018-12-09 19:35:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21450 to 19134. [2018-12-09 19:35:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19134 states. [2018-12-09 19:35:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19134 states to 19134 states and 57717 transitions. [2018-12-09 19:35:28,971 INFO L78 Accepts]: Start accepts. Automaton has 19134 states and 57717 transitions. Word has length 67 [2018-12-09 19:35:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:28,971 INFO L480 AbstractCegarLoop]: Abstraction has 19134 states and 57717 transitions. [2018-12-09 19:35:28,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19134 states and 57717 transitions. [2018-12-09 19:35:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:28,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:28,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:28,977 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:28,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:28,977 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2018-12-09 19:35:28,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:28,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:28,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:28,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:35:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:29,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:29,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:29,031 INFO L87 Difference]: Start difference. First operand 19134 states and 57717 transitions. Second operand 5 states. [2018-12-09 19:35:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:29,255 INFO L93 Difference]: Finished difference Result 25025 states and 74971 transitions. [2018-12-09 19:35:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:29,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:35:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:29,281 INFO L225 Difference]: With dead ends: 25025 [2018-12-09 19:35:29,281 INFO L226 Difference]: Without dead ends: 25025 [2018-12-09 19:35:29,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2018-12-09 19:35:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 22710. [2018-12-09 19:35:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22710 states. [2018-12-09 19:35:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22710 states to 22710 states and 67985 transitions. [2018-12-09 19:35:29,506 INFO L78 Accepts]: Start accepts. Automaton has 22710 states and 67985 transitions. Word has length 67 [2018-12-09 19:35:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:29,506 INFO L480 AbstractCegarLoop]: Abstraction has 22710 states and 67985 transitions. [2018-12-09 19:35:29,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 22710 states and 67985 transitions. [2018-12-09 19:35:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:29,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:29,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] [2018-12-09 19:35:29,514 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:29,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2018-12-09 19:35:29,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:29,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:29,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:29,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:29,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:29,550 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-09 19:35:29,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:29,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:29,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:29,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:29,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:29,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:29,551 INFO L87 Difference]: Start difference. First operand 22710 states and 67985 transitions. Second operand 5 states. [2018-12-09 19:35:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:29,868 INFO L93 Difference]: Finished difference Result 31960 states and 94824 transitions. [2018-12-09 19:35:29,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:35:29,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:35:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:29,902 INFO L225 Difference]: With dead ends: 31960 [2018-12-09 19:35:29,902 INFO L226 Difference]: Without dead ends: 31960 [2018-12-09 19:35:29,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31960 states. [2018-12-09 19:35:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31960 to 28240. [2018-12-09 19:35:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28240 states. [2018-12-09 19:35:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28240 states to 28240 states and 84212 transitions. [2018-12-09 19:35:30,207 INFO L78 Accepts]: Start accepts. Automaton has 28240 states and 84212 transitions. Word has length 67 [2018-12-09 19:35:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:30,207 INFO L480 AbstractCegarLoop]: Abstraction has 28240 states and 84212 transitions. [2018-12-09 19:35:30,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28240 states and 84212 transitions. [2018-12-09 19:35:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:30,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:30,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:30,215 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:30,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2018-12-09 19:35:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:30,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:30,262 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-09 19:35:30,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:30,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:30,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:30,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:30,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:30,263 INFO L87 Difference]: Start difference. First operand 28240 states and 84212 transitions. Second operand 4 states. [2018-12-09 19:35:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:30,866 INFO L93 Difference]: Finished difference Result 38784 states and 116172 transitions. [2018-12-09 19:35:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:35:30,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 19:35:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:30,910 INFO L225 Difference]: With dead ends: 38784 [2018-12-09 19:35:30,910 INFO L226 Difference]: Without dead ends: 38552 [2018-12-09 19:35:30,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38552 states. [2018-12-09 19:35:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38552 to 35692. [2018-12-09 19:35:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35692 states. [2018-12-09 19:35:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35692 states to 35692 states and 106997 transitions. [2018-12-09 19:35:31,315 INFO L78 Accepts]: Start accepts. Automaton has 35692 states and 106997 transitions. Word has length 67 [2018-12-09 19:35:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:31,315 INFO L480 AbstractCegarLoop]: Abstraction has 35692 states and 106997 transitions. [2018-12-09 19:35:31,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 35692 states and 106997 transitions. [2018-12-09 19:35:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:31,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:31,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:31,324 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2018-12-09 19:35:31,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:31,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-09 19:35:31,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:31,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:31,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:31,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:31,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:31,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:31,350 INFO L87 Difference]: Start difference. First operand 35692 states and 106997 transitions. Second operand 5 states. [2018-12-09 19:35:31,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:31,379 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-09 19:35:31,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:35:31,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:35:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:31,384 INFO L225 Difference]: With dead ends: 9316 [2018-12-09 19:35:31,384 INFO L226 Difference]: Without dead ends: 7464 [2018-12-09 19:35:31,384 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-09 19:35:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-09 19:35:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-09 19:35:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-09 19:35:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-09 19:35:31,433 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-09 19:35:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:31,433 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-09 19:35:31,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-09 19:35:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:35:31,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:31,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:31,436 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:31,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-09 19:35:31,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:31,457 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-09 19:35:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:31,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:31,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:31,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:31,460 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-09 19:35:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:31,489 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-09 19:35:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:31,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 19:35:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:31,495 INFO L225 Difference]: With dead ends: 8820 [2018-12-09 19:35:31,495 INFO L226 Difference]: Without dead ends: 8820 [2018-12-09 19:35:31,495 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-09 19:35:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-09 19:35:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-09 19:35:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-09 19:35:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-09 19:35:31,547 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-09 19:35:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:31,547 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-09 19:35:31,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-09 19:35:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:35:31,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:31,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:31,551 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:31,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-09 19:35:31,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:31,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:31,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:31,585 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-09 19:35:31,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:31,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:31,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:31,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:31,586 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-09 19:35:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:31,681 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-09 19:35:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:35:31,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 19:35:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:31,687 INFO L225 Difference]: With dead ends: 7470 [2018-12-09 19:35:31,687 INFO L226 Difference]: Without dead ends: 7470 [2018-12-09 19:35:31,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-09 19:35:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-09 19:35:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-09 19:35:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-09 19:35:31,734 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-09 19:35:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:31,734 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-09 19:35:31,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-09 19:35:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:35:31,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:31,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:31,738 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:31,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-09 19:35:31,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:31,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:31,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:31,781 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-09 19:35:31,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:31,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:31,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:31,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:31,782 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-09 19:35:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:32,009 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-09 19:35:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:35:32,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 19:35:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:32,014 INFO L225 Difference]: With dead ends: 7881 [2018-12-09 19:35:32,014 INFO L226 Difference]: Without dead ends: 7762 [2018-12-09 19:35:32,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:35:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-09 19:35:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-09 19:35:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-09 19:35:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-09 19:35:32,065 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-09 19:35:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:32,065 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-09 19:35:32,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-09 19:35:32,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 19:35:32,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:32,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:32,070 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:32,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1510650383, now seen corresponding path program 1 times [2018-12-09 19:35:32,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:32,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:32,104 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-09 19:35:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:32,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:32,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:32,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:32,105 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-09 19:35:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:32,272 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-09 19:35:32,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:32,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 19:35:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:32,279 INFO L225 Difference]: With dead ends: 10608 [2018-12-09 19:35:32,279 INFO L226 Difference]: Without dead ends: 10608 [2018-12-09 19:35:32,280 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-09 19:35:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-09 19:35:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-09 19:35:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-09 19:35:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-09 19:35:32,344 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-09 19:35:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:32,344 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-09 19:35:32,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-09 19:35:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 19:35:32,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:32,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:32,350 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:32,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2013691336, now seen corresponding path program 1 times [2018-12-09 19:35:32,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:32,394 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-09 19:35:32,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:32,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:35:32,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:32,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:35:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:35:32,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:35:32,395 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-09 19:35:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:32,457 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-09 19:35:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:35:32,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 19:35:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:32,463 INFO L225 Difference]: With dead ends: 8526 [2018-12-09 19:35:32,463 INFO L226 Difference]: Without dead ends: 8526 [2018-12-09 19:35:32,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-09 19:35:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-09 19:35:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-09 19:35:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-09 19:35:32,517 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-09 19:35:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:32,517 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-09 19:35:32,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:35:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-09 19:35:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:32,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:32,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:32,522 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1302041195, now seen corresponding path program 1 times [2018-12-09 19:35:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:32,558 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-09 19:35:32,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:32,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:32,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:32,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:32,558 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 5 states. [2018-12-09 19:35:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:32,632 INFO L93 Difference]: Finished difference Result 9015 states and 20390 transitions. [2018-12-09 19:35:32,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:32,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:35:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:32,638 INFO L225 Difference]: With dead ends: 9015 [2018-12-09 19:35:32,638 INFO L226 Difference]: Without dead ends: 9015 [2018-12-09 19:35:32,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2018-12-09 19:35:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 6969. [2018-12-09 19:35:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6969 states. [2018-12-09 19:35:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6969 states to 6969 states and 15888 transitions. [2018-12-09 19:35:32,689 INFO L78 Accepts]: Start accepts. Automaton has 6969 states and 15888 transitions. Word has length 94 [2018-12-09 19:35:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:32,689 INFO L480 AbstractCegarLoop]: Abstraction has 6969 states and 15888 transitions. [2018-12-09 19:35:32,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6969 states and 15888 transitions. [2018-12-09 19:35:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:32,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:32,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:32,694 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:32,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1556777740, now seen corresponding path program 1 times [2018-12-09 19:35:32,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:32,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:32,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:32,728 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-09 19:35:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:32,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:32,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:32,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:32,729 INFO L87 Difference]: Start difference. First operand 6969 states and 15888 transitions. Second operand 5 states. [2018-12-09 19:35:32,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:32,984 INFO L93 Difference]: Finished difference Result 13317 states and 30551 transitions. [2018-12-09 19:35:32,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:35:32,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:35:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:32,994 INFO L225 Difference]: With dead ends: 13317 [2018-12-09 19:35:32,994 INFO L226 Difference]: Without dead ends: 13317 [2018-12-09 19:35:32,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13317 states. [2018-12-09 19:35:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13317 to 8041. [2018-12-09 19:35:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8041 states. [2018-12-09 19:35:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8041 states to 8041 states and 18325 transitions. [2018-12-09 19:35:33,087 INFO L78 Accepts]: Start accepts. Automaton has 8041 states and 18325 transitions. Word has length 94 [2018-12-09 19:35:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:33,088 INFO L480 AbstractCegarLoop]: Abstraction has 8041 states and 18325 transitions. [2018-12-09 19:35:33,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8041 states and 18325 transitions. [2018-12-09 19:35:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:33,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:33,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:33,093 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:33,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -312013259, now seen corresponding path program 1 times [2018-12-09 19:35:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:33,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:33,165 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-09 19:35:33,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:33,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:35:33,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:33,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:35:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:35:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:33,166 INFO L87 Difference]: Start difference. First operand 8041 states and 18325 transitions. Second operand 8 states. [2018-12-09 19:35:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:33,437 INFO L93 Difference]: Finished difference Result 11629 states and 26298 transitions. [2018-12-09 19:35:33,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:35:33,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 19:35:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:33,445 INFO L225 Difference]: With dead ends: 11629 [2018-12-09 19:35:33,445 INFO L226 Difference]: Without dead ends: 11597 [2018-12-09 19:35:33,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:35:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11597 states. [2018-12-09 19:35:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11597 to 10054. [2018-12-09 19:35:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10054 states. [2018-12-09 19:35:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 22699 transitions. [2018-12-09 19:35:33,535 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 22699 transitions. Word has length 94 [2018-12-09 19:35:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:33,535 INFO L480 AbstractCegarLoop]: Abstraction has 10054 states and 22699 transitions. [2018-12-09 19:35:33,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:35:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 22699 transitions. [2018-12-09 19:35:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:33,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:33,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:33,542 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2108964618, now seen corresponding path program 1 times [2018-12-09 19:35:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:33,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:33,613 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-09 19:35:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:35:33,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:33,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:35:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:35:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:33,614 INFO L87 Difference]: Start difference. First operand 10054 states and 22699 transitions. Second operand 8 states. [2018-12-09 19:35:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:33,941 INFO L93 Difference]: Finished difference Result 16042 states and 36876 transitions. [2018-12-09 19:35:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:35:33,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 19:35:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:33,952 INFO L225 Difference]: With dead ends: 16042 [2018-12-09 19:35:33,952 INFO L226 Difference]: Without dead ends: 16042 [2018-12-09 19:35:33,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:35:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16042 states. [2018-12-09 19:35:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16042 to 11490. [2018-12-09 19:35:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-09 19:35:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 26152 transitions. [2018-12-09 19:35:34,052 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 26152 transitions. Word has length 94 [2018-12-09 19:35:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:34,052 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 26152 transitions. [2018-12-09 19:35:34,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:35:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 26152 transitions. [2018-12-09 19:35:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:34,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:34,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:34,059 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:34,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1221460937, now seen corresponding path program 1 times [2018-12-09 19:35:34,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:34,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:34,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:34,117 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-09 19:35:34,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:34,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:34,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:34,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:34,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:34,118 INFO L87 Difference]: Start difference. First operand 11490 states and 26152 transitions. Second operand 6 states. [2018-12-09 19:35:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:34,308 INFO L93 Difference]: Finished difference Result 11285 states and 25403 transitions. [2018-12-09 19:35:34,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:35:34,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 19:35:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:34,316 INFO L225 Difference]: With dead ends: 11285 [2018-12-09 19:35:34,316 INFO L226 Difference]: Without dead ends: 11285 [2018-12-09 19:35:34,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11285 states. [2018-12-09 19:35:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11285 to 10587. [2018-12-09 19:35:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10587 states. [2018-12-09 19:35:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10587 states to 10587 states and 23935 transitions. [2018-12-09 19:35:34,389 INFO L78 Accepts]: Start accepts. Automaton has 10587 states and 23935 transitions. Word has length 94 [2018-12-09 19:35:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:34,390 INFO L480 AbstractCegarLoop]: Abstraction has 10587 states and 23935 transitions. [2018-12-09 19:35:34,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10587 states and 23935 transitions. [2018-12-09 19:35:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:34,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:34,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:34,397 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:34,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1634726199, now seen corresponding path program 1 times [2018-12-09 19:35:34,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:34,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:34,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:34,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:34,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:34,458 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-09 19:35:34,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:34,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:35:34,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:34,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:35:34,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:35:34,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:34,459 INFO L87 Difference]: Start difference. First operand 10587 states and 23935 transitions. Second operand 9 states. [2018-12-09 19:35:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:35,460 INFO L93 Difference]: Finished difference Result 23262 states and 52962 transitions. [2018-12-09 19:35:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 19:35:35,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 19:35:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:35,477 INFO L225 Difference]: With dead ends: 23262 [2018-12-09 19:35:35,477 INFO L226 Difference]: Without dead ends: 23079 [2018-12-09 19:35:35,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 19:35:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23079 states. [2018-12-09 19:35:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23079 to 12395. [2018-12-09 19:35:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12395 states. [2018-12-09 19:35:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 28322 transitions. [2018-12-09 19:35:35,624 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 28322 transitions. Word has length 94 [2018-12-09 19:35:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:35,625 INFO L480 AbstractCegarLoop]: Abstraction has 12395 states and 28322 transitions. [2018-12-09 19:35:35,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:35:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 28322 transitions. [2018-12-09 19:35:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:35,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:35,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:35,633 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:35,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1415476616, now seen corresponding path program 1 times [2018-12-09 19:35:35,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:35,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:35,699 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-09 19:35:35,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:35,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:35,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:35,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:35,700 INFO L87 Difference]: Start difference. First operand 12395 states and 28322 transitions. Second operand 7 states. [2018-12-09 19:35:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:35,988 INFO L93 Difference]: Finished difference Result 15035 states and 34140 transitions. [2018-12-09 19:35:35,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:35:35,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 19:35:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:35,999 INFO L225 Difference]: With dead ends: 15035 [2018-12-09 19:35:35,999 INFO L226 Difference]: Without dead ends: 14880 [2018-12-09 19:35:35,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:35:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14880 states. [2018-12-09 19:35:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14880 to 12472. [2018-12-09 19:35:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12472 states. [2018-12-09 19:35:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12472 states to 12472 states and 28476 transitions. [2018-12-09 19:35:36,107 INFO L78 Accepts]: Start accepts. Automaton has 12472 states and 28476 transitions. Word has length 94 [2018-12-09 19:35:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,107 INFO L480 AbstractCegarLoop]: Abstraction has 12472 states and 28476 transitions. [2018-12-09 19:35:36,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 12472 states and 28476 transitions. [2018-12-09 19:35:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:36,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,116 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:36,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1355337815, now seen corresponding path program 1 times [2018-12-09 19:35:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,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-09 19:35:36,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:36,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:36,157 INFO L87 Difference]: Start difference. First operand 12472 states and 28476 transitions. Second operand 5 states. [2018-12-09 19:35:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,376 INFO L93 Difference]: Finished difference Result 15432 states and 34838 transitions. [2018-12-09 19:35:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:35:36,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:35:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,386 INFO L225 Difference]: With dead ends: 15432 [2018-12-09 19:35:36,386 INFO L226 Difference]: Without dead ends: 15209 [2018-12-09 19:35:36,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15209 states. [2018-12-09 19:35:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15209 to 12998. [2018-12-09 19:35:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12998 states. [2018-12-09 19:35:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12998 states to 12998 states and 29695 transitions. [2018-12-09 19:35:36,492 INFO L78 Accepts]: Start accepts. Automaton has 12998 states and 29695 transitions. Word has length 94 [2018-12-09 19:35:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,492 INFO L480 AbstractCegarLoop]: Abstraction has 12998 states and 29695 transitions. [2018-12-09 19:35:36,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12998 states and 29695 transitions. [2018-12-09 19:35:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:36,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,502 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:36,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash 25938264, now seen corresponding path program 1 times [2018-12-09 19:35:36,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:35:36,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:35:36,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:35:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:35:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:35:36,539 INFO L87 Difference]: Start difference. First operand 12998 states and 29695 transitions. Second operand 5 states. [2018-12-09 19:35:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:36,681 INFO L93 Difference]: Finished difference Result 16514 states and 37363 transitions. [2018-12-09 19:35:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:35:36,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 19:35:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:36,692 INFO L225 Difference]: With dead ends: 16514 [2018-12-09 19:35:36,692 INFO L226 Difference]: Without dead ends: 16364 [2018-12-09 19:35:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-09 19:35:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16364 states. [2018-12-09 19:35:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16364 to 12732. [2018-12-09 19:35:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12732 states. [2018-12-09 19:35:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12732 states to 12732 states and 29112 transitions. [2018-12-09 19:35:36,828 INFO L78 Accepts]: Start accepts. Automaton has 12732 states and 29112 transitions. Word has length 94 [2018-12-09 19:35:36,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:36,828 INFO L480 AbstractCegarLoop]: Abstraction has 12732 states and 29112 transitions. [2018-12-09 19:35:36,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:35:36,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12732 states and 29112 transitions. [2018-12-09 19:35:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:36,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:36,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:36,836 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:36,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1084106277, now seen corresponding path program 2 times [2018-12-09 19:35:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:36,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:36,923 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-09 19:35:36,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:36,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:36,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:36,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:36,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:36,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:36,924 INFO L87 Difference]: Start difference. First operand 12732 states and 29112 transitions. Second operand 7 states. [2018-12-09 19:35:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:37,158 INFO L93 Difference]: Finished difference Result 15715 states and 35417 transitions. [2018-12-09 19:35:37,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:35:37,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 19:35:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:37,169 INFO L225 Difference]: With dead ends: 15715 [2018-12-09 19:35:37,169 INFO L226 Difference]: Without dead ends: 15715 [2018-12-09 19:35:37,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:35:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15715 states. [2018-12-09 19:35:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15715 to 12946. [2018-12-09 19:35:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12946 states. [2018-12-09 19:35:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 29581 transitions. [2018-12-09 19:35:37,278 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 29581 transitions. Word has length 94 [2018-12-09 19:35:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:37,279 INFO L480 AbstractCegarLoop]: Abstraction has 12946 states and 29581 transitions. [2018-12-09 19:35:37,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 29581 transitions. [2018-12-09 19:35:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:37,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:37,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:37,288 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:37,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash -245293274, now seen corresponding path program 2 times [2018-12-09 19:35:37,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:35:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:37,329 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-09 19:35:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:35:37,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:37,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:35:37,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:35:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:35:37,330 INFO L87 Difference]: Start difference. First operand 12946 states and 29581 transitions. Second operand 6 states. [2018-12-09 19:35:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:37,437 INFO L93 Difference]: Finished difference Result 12930 states and 29416 transitions. [2018-12-09 19:35:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:35:37,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 19:35:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:37,446 INFO L225 Difference]: With dead ends: 12930 [2018-12-09 19:35:37,447 INFO L226 Difference]: Without dead ends: 12930 [2018-12-09 19:35:37,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12930 states. [2018-12-09 19:35:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12930 to 12527. [2018-12-09 19:35:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12527 states. [2018-12-09 19:35:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12527 states to 12527 states and 28588 transitions. [2018-12-09 19:35:37,543 INFO L78 Accepts]: Start accepts. Automaton has 12527 states and 28588 transitions. Word has length 94 [2018-12-09 19:35:37,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:37,543 INFO L480 AbstractCegarLoop]: Abstraction has 12527 states and 28588 transitions. [2018-12-09 19:35:37,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:35:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 12527 states and 28588 transitions. [2018-12-09 19:35:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:37,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:37,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:37,552 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:37,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 675470531, now seen corresponding path program 1 times [2018-12-09 19:35:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:35:37,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:37,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:37,630 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-09 19:35:37,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:37,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:35:37,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:37,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:35:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:35:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:37,631 INFO L87 Difference]: Start difference. First operand 12527 states and 28588 transitions. Second operand 9 states. [2018-12-09 19:35:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:37,947 INFO L93 Difference]: Finished difference Result 15921 states and 36379 transitions. [2018-12-09 19:35:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 19:35:37,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 19:35:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:37,958 INFO L225 Difference]: With dead ends: 15921 [2018-12-09 19:35:37,958 INFO L226 Difference]: Without dead ends: 15889 [2018-12-09 19:35:37,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:35:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15889 states. [2018-12-09 19:35:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15889 to 12058. [2018-12-09 19:35:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12058 states. [2018-12-09 19:35:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12058 states to 12058 states and 27511 transitions. [2018-12-09 19:35:38,063 INFO L78 Accepts]: Start accepts. Automaton has 12058 states and 27511 transitions. Word has length 94 [2018-12-09 19:35:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:38,063 INFO L480 AbstractCegarLoop]: Abstraction has 12058 states and 27511 transitions. [2018-12-09 19:35:38,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:35:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 12058 states and 27511 transitions. [2018-12-09 19:35:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 19:35:38,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:38,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:38,072 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:38,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash -233977147, now seen corresponding path program 1 times [2018-12-09 19:35:38,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:38,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:38,097 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-09 19:35:38,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:38,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:35:38,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:38,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:35:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:35:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:38,098 INFO L87 Difference]: Start difference. First operand 12058 states and 27511 transitions. Second operand 3 states. [2018-12-09 19:35:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:38,122 INFO L93 Difference]: Finished difference Result 11802 states and 26679 transitions. [2018-12-09 19:35:38,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:35:38,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-09 19:35:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:38,130 INFO L225 Difference]: With dead ends: 11802 [2018-12-09 19:35:38,130 INFO L226 Difference]: Without dead ends: 11770 [2018-12-09 19:35:38,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:35:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11770 states. [2018-12-09 19:35:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11770 to 9176. [2018-12-09 19:35:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2018-12-09 19:35:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 20537 transitions. [2018-12-09 19:35:38,209 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 20537 transitions. Word has length 94 [2018-12-09 19:35:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:38,209 INFO L480 AbstractCegarLoop]: Abstraction has 9176 states and 20537 transitions. [2018-12-09 19:35:38,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:35:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 20537 transitions. [2018-12-09 19:35:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:38,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:38,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:38,215 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:38,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 839634464, now seen corresponding path program 1 times [2018-12-09 19:35:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:38,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:38,295 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-09 19:35:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:38,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:35:38,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:38,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:35:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:35:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:38,296 INFO L87 Difference]: Start difference. First operand 9176 states and 20537 transitions. Second operand 8 states. [2018-12-09 19:35:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:38,507 INFO L93 Difference]: Finished difference Result 10623 states and 23488 transitions. [2018-12-09 19:35:38,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:35:38,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 19:35:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:38,514 INFO L225 Difference]: With dead ends: 10623 [2018-12-09 19:35:38,514 INFO L226 Difference]: Without dead ends: 10623 [2018-12-09 19:35:38,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:35:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10623 states. [2018-12-09 19:35:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10623 to 9535. [2018-12-09 19:35:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9535 states. [2018-12-09 19:35:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9535 states to 9535 states and 21267 transitions. [2018-12-09 19:35:38,583 INFO L78 Accepts]: Start accepts. Automaton has 9535 states and 21267 transitions. Word has length 96 [2018-12-09 19:35:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:38,583 INFO L480 AbstractCegarLoop]: Abstraction has 9535 states and 21267 transitions. [2018-12-09 19:35:38,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:35:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9535 states and 21267 transitions. [2018-12-09 19:35:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:38,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:38,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:38,590 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:38,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1050985377, now seen corresponding path program 1 times [2018-12-09 19:35:38,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:38,685 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-09 19:35:38,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:38,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:35:38,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:38,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:35:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:35:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:35:38,686 INFO L87 Difference]: Start difference. First operand 9535 states and 21267 transitions. Second operand 8 states. [2018-12-09 19:35:38,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:38,885 INFO L93 Difference]: Finished difference Result 10658 states and 23664 transitions. [2018-12-09 19:35:38,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:35:38,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 19:35:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:38,892 INFO L225 Difference]: With dead ends: 10658 [2018-12-09 19:35:38,892 INFO L226 Difference]: Without dead ends: 10658 [2018-12-09 19:35:38,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:35:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10658 states. [2018-12-09 19:35:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10658 to 8111. [2018-12-09 19:35:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-12-09 19:35:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 18092 transitions. [2018-12-09 19:35:38,957 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 18092 transitions. Word has length 96 [2018-12-09 19:35:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:38,957 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 18092 transitions. [2018-12-09 19:35:38,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:35:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 18092 transitions. [2018-12-09 19:35:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:38,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:38,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:38,963 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:38,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1938489058, now seen corresponding path program 1 times [2018-12-09 19:35:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:38,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:39,048 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-09 19:35:39,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:39,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:35:39,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:39,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:35:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:35:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:35:39,049 INFO L87 Difference]: Start difference. First operand 8111 states and 18092 transitions. Second operand 11 states. [2018-12-09 19:35:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:39,850 INFO L93 Difference]: Finished difference Result 15034 states and 33850 transitions. [2018-12-09 19:35:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:35:39,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 19:35:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:39,857 INFO L225 Difference]: With dead ends: 15034 [2018-12-09 19:35:39,857 INFO L226 Difference]: Without dead ends: 9949 [2018-12-09 19:35:39,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 19:35:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9949 states. [2018-12-09 19:35:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9949 to 7689. [2018-12-09 19:35:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7689 states. [2018-12-09 19:35:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 17114 transitions. [2018-12-09 19:35:39,924 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 17114 transitions. Word has length 96 [2018-12-09 19:35:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:39,924 INFO L480 AbstractCegarLoop]: Abstraction has 7689 states and 17114 transitions. [2018-12-09 19:35:39,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:35:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 17114 transitions. [2018-12-09 19:35:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:39,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:39,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:39,932 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:39,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1552227223, now seen corresponding path program 1 times [2018-12-09 19:35:39,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:39,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:40,026 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-09 19:35:40,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:40,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:40,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:40,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:40,027 INFO L87 Difference]: Start difference. First operand 7689 states and 17114 transitions. Second operand 7 states. [2018-12-09 19:35:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:40,235 INFO L93 Difference]: Finished difference Result 9629 states and 21147 transitions. [2018-12-09 19:35:40,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:35:40,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 19:35:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:40,242 INFO L225 Difference]: With dead ends: 9629 [2018-12-09 19:35:40,242 INFO L226 Difference]: Without dead ends: 9550 [2018-12-09 19:35:40,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:35:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9550 states. [2018-12-09 19:35:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9550 to 7800. [2018-12-09 19:35:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7800 states. [2018-12-09 19:35:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 17314 transitions. [2018-12-09 19:35:40,322 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 17314 transitions. Word has length 96 [2018-12-09 19:35:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:40,322 INFO L480 AbstractCegarLoop]: Abstraction has 7800 states and 17314 transitions. [2018-12-09 19:35:40,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 17314 transitions. [2018-12-09 19:35:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:40,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:40,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:40,328 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:40,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 795058474, now seen corresponding path program 1 times [2018-12-09 19:35:40,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:40,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:40,389 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-09 19:35:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:40,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:40,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:40,389 INFO L87 Difference]: Start difference. First operand 7800 states and 17314 transitions. Second operand 7 states. [2018-12-09 19:35:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:40,597 INFO L93 Difference]: Finished difference Result 8546 states and 18943 transitions. [2018-12-09 19:35:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:35:40,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 19:35:40,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:40,602 INFO L225 Difference]: With dead ends: 8546 [2018-12-09 19:35:40,602 INFO L226 Difference]: Without dead ends: 8546 [2018-12-09 19:35:40,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8546 states. [2018-12-09 19:35:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8546 to 8020. [2018-12-09 19:35:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8020 states. [2018-12-09 19:35:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 17776 transitions. [2018-12-09 19:35:40,665 INFO L78 Accepts]: Start accepts. Automaton has 8020 states and 17776 transitions. Word has length 96 [2018-12-09 19:35:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:40,665 INFO L480 AbstractCegarLoop]: Abstraction has 8020 states and 17776 transitions. [2018-12-09 19:35:40,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 8020 states and 17776 transitions. [2018-12-09 19:35:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:40,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:40,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:40,672 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:40,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1529942070, now seen corresponding path program 1 times [2018-12-09 19:35:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:40,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:40,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:40,831 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-09 19:35:40,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:40,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:35:40,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:40,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:35:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:35:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:40,832 INFO L87 Difference]: Start difference. First operand 8020 states and 17776 transitions. Second operand 9 states. [2018-12-09 19:35:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:41,178 INFO L93 Difference]: Finished difference Result 9230 states and 20279 transitions. [2018-12-09 19:35:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:35:41,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 19:35:41,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:41,184 INFO L225 Difference]: With dead ends: 9230 [2018-12-09 19:35:41,184 INFO L226 Difference]: Without dead ends: 9230 [2018-12-09 19:35:41,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:35:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9230 states. [2018-12-09 19:35:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9230 to 8073. [2018-12-09 19:35:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8073 states. [2018-12-09 19:35:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 17899 transitions. [2018-12-09 19:35:41,242 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 17899 transitions. Word has length 96 [2018-12-09 19:35:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:41,242 INFO L480 AbstractCegarLoop]: Abstraction has 8073 states and 17899 transitions. [2018-12-09 19:35:41,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:35:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 17899 transitions. [2018-12-09 19:35:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:41,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:41,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:41,248 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:41,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash -362468405, now seen corresponding path program 1 times [2018-12-09 19:35:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:41,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:41,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:41,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:41,314 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-09 19:35:41,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:41,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:35:41,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:41,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:35:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:35:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:35:41,315 INFO L87 Difference]: Start difference. First operand 8073 states and 17899 transitions. Second operand 9 states. [2018-12-09 19:35:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:41,572 INFO L93 Difference]: Finished difference Result 11203 states and 24786 transitions. [2018-12-09 19:35:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:35:41,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 19:35:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:41,579 INFO L225 Difference]: With dead ends: 11203 [2018-12-09 19:35:41,579 INFO L226 Difference]: Without dead ends: 11203 [2018-12-09 19:35:41,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:35:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2018-12-09 19:35:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 8727. [2018-12-09 19:35:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8727 states. [2018-12-09 19:35:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8727 states to 8727 states and 19308 transitions. [2018-12-09 19:35:41,646 INFO L78 Accepts]: Start accepts. Automaton has 8727 states and 19308 transitions. Word has length 96 [2018-12-09 19:35:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:41,646 INFO L480 AbstractCegarLoop]: Abstraction has 8727 states and 19308 transitions. [2018-12-09 19:35:41,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:35:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8727 states and 19308 transitions. [2018-12-09 19:35:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:41,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:41,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:41,652 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:41,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1254638411, now seen corresponding path program 2 times [2018-12-09 19:35:41,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:41,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:35:41,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:41,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:35:41,726 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-09 19:35:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:35:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:35:41,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:35:41,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:35:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:35:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:35:41,727 INFO L87 Difference]: Start difference. First operand 8727 states and 19308 transitions. Second operand 7 states. [2018-12-09 19:35:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:35:41,945 INFO L93 Difference]: Finished difference Result 10596 states and 23185 transitions. [2018-12-09 19:35:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:35:41,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-09 19:35:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:35:41,952 INFO L225 Difference]: With dead ends: 10596 [2018-12-09 19:35:41,952 INFO L226 Difference]: Without dead ends: 10596 [2018-12-09 19:35:41,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:35:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2018-12-09 19:35:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 9240. [2018-12-09 19:35:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9240 states. [2018-12-09 19:35:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9240 states to 9240 states and 20447 transitions. [2018-12-09 19:35:42,020 INFO L78 Accepts]: Start accepts. Automaton has 9240 states and 20447 transitions. Word has length 96 [2018-12-09 19:35:42,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:35:42,020 INFO L480 AbstractCegarLoop]: Abstraction has 9240 states and 20447 transitions. [2018-12-09 19:35:42,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:35:42,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9240 states and 20447 transitions. [2018-12-09 19:35:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 19:35:42,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:35:42,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:35:42,026 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:35:42,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:35:42,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1465989324, now seen corresponding path program 2 times [2018-12-09 19:35:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:35:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:42,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:35:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:35:42,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:35:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:35:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:35:42,077 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:35:42,145 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:35:42,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:35:42 BasicIcfg [2018-12-09 19:35:42,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:35:42,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:35:42,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:35:42,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:35:42,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:20" (3/4) ... [2018-12-09 19:35:42,149 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:35:42,218 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f0cbadbf-00e5-42e8-bbc9-b24cba8151ba/bin-2019/utaipan/witness.graphml [2018-12-09 19:35:42,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:35:42,219 INFO L168 Benchmark]: Toolchain (without parser) took 22358.10 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.3 MB in the beginning and 2.0 GB in the end (delta: -999.1 MB). Peak memory consumption was 954.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: Boogie Preprocessor took 23.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: RCFGBuilder took 330.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,220 INFO L168 Benchmark]: TraceAbstraction took 21528.32 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -984.8 MB). Peak memory consumption was 881.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,221 INFO L168 Benchmark]: Witness Printer took 71.74 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:35:42,222 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21528.32 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -984.8 MB). Peak memory consumption was 881.2 MB. Max. memory is 11.5 GB. * Witness Printer took 71.74 ms. Allocated memory is still 3.0 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L778] -1 pthread_t t1607; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L779] FCALL, FORK -1 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 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, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1608; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 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 [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 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 [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 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 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] EXPR 1 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -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) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -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 [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -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 [L794] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 21.4s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10788 SDtfs, 12828 SDslu, 26346 SDs, 0 SdLazy, 12085 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 477 GetRequests, 110 SyntacticMatches, 46 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35692occurred in iteration=15, 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: 5.9s AutomataMinimizationTime, 42 MinimizatonAttempts, 115263 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3412 NumberOfCodeBlocks, 3412 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3274 ConstructedInterpolants, 0 QuantifiedInterpolants, 889995 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 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...