./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_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_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/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 73df3d994267c42eb7b3d426a71db570dbf7c4f8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 04:57:08,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:57:08,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:57:08,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:57:08,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:57:08,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:57:08,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:57:08,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:57:08,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:57:08,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:57:08,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:57:08,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:57:08,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:57:08,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:57:08,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:57:08,662 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:57:08,663 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:57:08,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:57:08,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:57:08,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:57:08,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:57:08,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:57:08,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:57:08,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:57:08,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:57:08,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:57:08,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:57:08,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:57:08,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:57:08,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:57:08,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:57:08,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:57:08,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:57:08,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:57:08,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:57:08,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:57:08,676 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:57:08,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:57:08,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:57:08,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:57:08,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:57:08,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:57:08,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:57:08,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:57:08,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:57:08,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:57:08,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:57:08,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:57:08,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:57:08,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:57:08,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:57:08,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:57:08,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:57:08,691 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_12f2a1ad-50b7-4b15-875b-b8834b6890ca/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 -> 73df3d994267c42eb7b3d426a71db570dbf7c4f8 [2018-12-02 04:57:08,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:57:08,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:57:08,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:57:08,725 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:57:08,726 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:57:08,726 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc_false-unreach-call.i [2018-12-02 04:57:08,765 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/data/881a0922f/36b956c184504f00954899d51bc780fd/FLAG9ae8d9f4b [2018-12-02 04:57:09,131 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:57:09,131 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc_false-unreach-call.i [2018-12-02 04:57:09,139 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/data/881a0922f/36b956c184504f00954899d51bc780fd/FLAG9ae8d9f4b [2018-12-02 04:57:09,493 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/data/881a0922f/36b956c184504f00954899d51bc780fd [2018-12-02 04:57:09,496 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:57:09,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:57:09,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:57:09,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:57:09,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:57:09,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73559806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09, skipping insertion in model container [2018-12-02 04:57:09,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:57:09,550 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:57:09,748 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:57:09,758 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:57:09,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:57:09,858 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:57:09,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09 WrapperNode [2018-12-02 04:57:09,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:57:09,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:57:09,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:57:09,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:57:09,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:57:09,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:57:09,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:57:09,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:57:09,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... [2018-12-02 04:57:09,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:57:09,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:57:09,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:57:09,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:57:09,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/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-02 04:57:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:57:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:57:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 04:57:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:57:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 04:57:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 04:57:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 04:57:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 04:57:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 04:57:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:57:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:57:09,943 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 04:57:10,231 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:57:10,231 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 04:57:10,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:57:10 BoogieIcfgContainer [2018-12-02 04:57:10,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:57:10,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:57:10,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:57:10,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:57:10,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:57:09" (1/3) ... [2018-12-02 04:57:10,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942d471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:57:10, skipping insertion in model container [2018-12-02 04:57:10,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:57:09" (2/3) ... [2018-12-02 04:57:10,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6942d471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:57:10, skipping insertion in model container [2018-12-02 04:57:10,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:57:10" (3/3) ... [2018-12-02 04:57:10,236 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_pso.oepc_false-unreach-call.i [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,259 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,260 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,269 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,270 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,271 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,272 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 04:57:10,275 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 04:57:10,276 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:57:10,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 04:57:10,291 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 04:57:10,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:57:10,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:57:10,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:57:10,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:57:10,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:57:10,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:57:10,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:57:10,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:57:10,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-02 04:57:11,425 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-02 04:57:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-02 04:57:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 04:57:11,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:11,433 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] [2018-12-02 04:57:11,434 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:11,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-02 04:57:11,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:11,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:11,574 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-02 04:57:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:57:11,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:11,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:11,589 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-02 04:57:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:12,014 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-02 04:57:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:57:12,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 04:57:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:12,149 INFO L225 Difference]: With dead ends: 47767 [2018-12-02 04:57:12,150 INFO L226 Difference]: Without dead ends: 34607 [2018-12-02 04:57:12,151 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-02 04:57:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-02 04:57:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-02 04:57:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-02 04:57:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-02 04:57:12,778 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-02 04:57:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:12,779 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-02 04:57:12,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-02 04:57:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 04:57:12,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:12,783 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-02 04:57:12,783 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:12,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-02 04:57:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:12,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:12,841 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-02 04:57:12,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:12,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:12,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:12,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:12,843 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-02 04:57:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:13,334 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-02 04:57:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:13,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 04:57:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:13,457 INFO L225 Difference]: With dead ends: 47633 [2018-12-02 04:57:13,457 INFO L226 Difference]: Without dead ends: 47065 [2018-12-02 04:57:13,458 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-02 04:57:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-02 04:57:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-02 04:57:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-02 04:57:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-02 04:57:14,094 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-02 04:57:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:14,095 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-02 04:57:14,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-02 04:57:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 04:57:14,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:14,097 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-02 04:57:14,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:14,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-02 04:57:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:14,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:14,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:14,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:57:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:14,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:14,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:14,147 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-02 04:57:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:14,494 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-02 04:57:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:14,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 04:57:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:14,607 INFO L225 Difference]: With dead ends: 63027 [2018-12-02 04:57:14,607 INFO L226 Difference]: Without dead ends: 62563 [2018-12-02 04:57:14,607 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-02 04:57:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-02 04:57:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-02 04:57:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-02 04:57:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-02 04:57:15,448 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-02 04:57:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:15,448 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-02 04:57:15,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-02 04:57:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 04:57:15,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:15,453 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-02 04:57:15,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:15,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-02 04:57:15,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:15,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:15,489 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-02 04:57:15,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:15,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:57:15,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:15,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:57:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:57:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:57:15,490 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-02 04:57:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:15,640 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-02 04:57:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:57:15,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 04:57:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:15,709 INFO L225 Difference]: With dead ends: 45909 [2018-12-02 04:57:15,710 INFO L226 Difference]: Without dead ends: 45909 [2018-12-02 04:57:15,710 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-02 04:57:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-02 04:57:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-02 04:57:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-02 04:57:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-02 04:57:16,449 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-02 04:57:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:16,449 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-02 04:57:16,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:57:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-02 04:57:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 04:57:16,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:16,456 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-02 04:57:16,456 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:16,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-12-02 04:57:16,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:16,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:16,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:16,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:16,496 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-02 04:57:16,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:16,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:16,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:16,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:16,497 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-02 04:57:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:16,933 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-02 04:57:16,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:57:16,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 04:57:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:17,048 INFO L225 Difference]: With dead ends: 70849 [2018-12-02 04:57:17,048 INFO L226 Difference]: Without dead ends: 70313 [2018-12-02 04:57:17,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:57:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-02 04:57:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-02 04:57:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-02 04:57:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-02 04:57:17,788 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-02 04:57:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:17,789 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-02 04:57:17,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-02 04:57:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 04:57:17,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:17,795 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-02 04:57:17,795 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:17,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-02 04:57:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:17,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:17,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:17,873 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-02 04:57:17,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:17,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:17,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:17,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:17,874 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-02 04:57:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:18,356 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-02 04:57:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:18,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 04:57:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:18,556 INFO L225 Difference]: With dead ends: 56598 [2018-12-02 04:57:18,556 INFO L226 Difference]: Without dead ends: 55459 [2018-12-02 04:57:18,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:57:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-02 04:57:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-02 04:57:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-02 04:57:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-02 04:57:19,275 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-02 04:57:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:19,276 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-02 04:57:19,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-02 04:57:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 04:57:19,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:19,285 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-02 04:57:19,285 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:19,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-02 04:57:19,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:19,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:19,342 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-02 04:57:19,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:19,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:57:19,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:19,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:57:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:57:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:19,343 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-02 04:57:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:20,083 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-02 04:57:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:57:20,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 04:57:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:20,202 INFO L225 Difference]: With dead ends: 75637 [2018-12-02 04:57:20,202 INFO L226 Difference]: Without dead ends: 75637 [2018-12-02 04:57:20,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:57:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-02 04:57:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-02 04:57:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-02 04:57:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-02 04:57:21,191 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-02 04:57:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:21,192 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-02 04:57:21,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:57:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-02 04:57:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 04:57:21,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:21,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:21,201 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:21,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-02 04:57:21,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:21,228 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-02 04:57:21,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:21,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:57:21,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:21,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:21,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:21,229 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-02 04:57:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:21,272 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-02 04:57:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:57:21,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 04:57:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:21,285 INFO L225 Difference]: With dead ends: 13777 [2018-12-02 04:57:21,285 INFO L226 Difference]: Without dead ends: 12160 [2018-12-02 04:57:21,286 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-02 04:57:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-02 04:57:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-02 04:57:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-02 04:57:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-02 04:57:21,402 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-02 04:57:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:21,403 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-02 04:57:21,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-02 04:57:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 04:57:21,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:21,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:21,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:21,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-02 04:57:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:21,441 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-02 04:57:21,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:21,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:57:21,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:21,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:21,442 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-02 04:57:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:21,553 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-02 04:57:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:57:21,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 04:57:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:21,570 INFO L225 Difference]: With dead ends: 14275 [2018-12-02 04:57:21,570 INFO L226 Difference]: Without dead ends: 14275 [2018-12-02 04:57:21,571 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-02 04:57:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-02 04:57:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-02 04:57:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-02 04:57:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-02 04:57:21,711 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-02 04:57:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:21,711 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-02 04:57:21,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-02 04:57:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 04:57:21,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:21,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:21,715 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:21,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:21,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-02 04:57:21,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:21,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:21,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:21,753 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-02 04:57:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:21,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:21,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:21,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:21,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:21,754 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-02 04:57:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:22,035 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-02 04:57:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:57:22,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 04:57:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:22,060 INFO L225 Difference]: With dead ends: 23410 [2018-12-02 04:57:22,060 INFO L226 Difference]: Without dead ends: 23346 [2018-12-02 04:57:22,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:57:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-02 04:57:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-02 04:57:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-02 04:57:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-02 04:57:22,245 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-02 04:57:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:22,245 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-02 04:57:22,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-02 04:57:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 04:57:22,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:22,251 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-02 04:57:22,251 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:22,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-02 04:57:22,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:22,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:57:22,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:22,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:57:22,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:22,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:22,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:22,281 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-02 04:57:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:22,428 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-02 04:57:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:57:22,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 04:57:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:22,446 INFO L225 Difference]: With dead ends: 17359 [2018-12-02 04:57:22,446 INFO L226 Difference]: Without dead ends: 17359 [2018-12-02 04:57:22,447 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-02 04:57:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-02 04:57:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-02 04:57:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-02 04:57:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-02 04:57:22,615 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-02 04:57:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:22,616 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-02 04:57:22,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-02 04:57:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 04:57:22,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:22,625 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-02 04:57:22,625 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-02 04:57:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:22,645 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-02 04:57:22,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:22,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:57:22,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:22,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:57:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:57:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:57:22,646 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-02 04:57:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:22,776 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-02 04:57:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:57:22,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 04:57:22,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:22,796 INFO L225 Difference]: With dead ends: 16413 [2018-12-02 04:57:22,796 INFO L226 Difference]: Without dead ends: 16413 [2018-12-02 04:57:22,796 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-02 04:57:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-02 04:57:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-02 04:57:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-02 04:57:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-02 04:57:22,973 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-02 04:57:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:22,973 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-02 04:57:22,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:57:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-02 04:57:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:22,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:22,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:22,982 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:22,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-02 04:57:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:22,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:23,032 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-02 04:57:23,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:23,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:23,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:23,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:23,033 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-02 04:57:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:23,437 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-02 04:57:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:57:23,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 04:57:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:23,457 INFO L225 Difference]: With dead ends: 19568 [2018-12-02 04:57:23,457 INFO L226 Difference]: Without dead ends: 19568 [2018-12-02 04:57:23,457 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-02 04:57:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-02 04:57:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-02 04:57:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-02 04:57:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-02 04:57:23,644 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-02 04:57:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:23,644 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-02 04:57:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-02 04:57:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:23,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:23,654 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-02 04:57:23,654 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:23,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:23,655 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-02 04:57:23,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:23,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:23,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:23,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:23,724 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-02 04:57:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:23,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:23,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:23,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:23,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:23,725 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-02 04:57:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:23,947 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-02 04:57:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:57:23,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 04:57:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:23,969 INFO L225 Difference]: With dead ends: 21666 [2018-12-02 04:57:23,969 INFO L226 Difference]: Without dead ends: 21666 [2018-12-02 04:57:23,969 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-02 04:57:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-02 04:57:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-02 04:57:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-02 04:57:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-02 04:57:24,154 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-02 04:57:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:24,155 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-02 04:57:24,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-02 04:57:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:24,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:24,163 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-02 04:57:24,163 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:24,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-02 04:57:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:24,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:24,206 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-02 04:57:24,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:24,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:24,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:24,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:24,207 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-02 04:57:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:24,381 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-02 04:57:24,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:57:24,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 04:57:24,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:24,405 INFO L225 Difference]: With dead ends: 23854 [2018-12-02 04:57:24,405 INFO L226 Difference]: Without dead ends: 23854 [2018-12-02 04:57:24,405 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-02 04:57:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-02 04:57:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-02 04:57:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-02 04:57:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-02 04:57:24,616 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-02 04:57:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:24,617 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-02 04:57:24,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-02 04:57:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:24,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:24,626 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-02 04:57:24,626 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:24,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-02 04:57:24,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:24,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:24,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:24,661 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-02 04:57:24,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:24,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:24,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:24,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:24,663 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-02 04:57:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:24,912 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-02 04:57:24,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:24,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 04:57:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:24,940 INFO L225 Difference]: With dead ends: 27231 [2018-12-02 04:57:24,940 INFO L226 Difference]: Without dead ends: 27231 [2018-12-02 04:57:24,940 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-02 04:57:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-02 04:57:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-02 04:57:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-02 04:57:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-02 04:57:25,184 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-02 04:57:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:25,185 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-02 04:57:25,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-02 04:57:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:25,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:25,194 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-02 04:57:25,194 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:25,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-02 04:57:25,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:25,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:57:25,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:25,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:57:25,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:25,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:25,230 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-02 04:57:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:25,525 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-02 04:57:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:57:25,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 04:57:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:25,555 INFO L225 Difference]: With dead ends: 28445 [2018-12-02 04:57:25,555 INFO L226 Difference]: Without dead ends: 28025 [2018-12-02 04:57:25,555 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-02 04:57:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-02 04:57:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-02 04:57:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-02 04:57:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-02 04:57:25,837 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-02 04:57:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:25,837 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-02 04:57:25,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-02 04:57:25,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 04:57:25,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:25,850 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-02 04:57:25,850 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:25,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:25,850 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-02 04:57:25,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:25,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:25,884 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-02 04:57:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:25,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:25,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:25,884 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-12-02 04:57:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:25,915 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-12-02 04:57:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:57:25,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 04:57:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:25,919 INFO L225 Difference]: With dead ends: 7049 [2018-12-02 04:57:25,919 INFO L226 Difference]: Without dead ends: 5562 [2018-12-02 04:57:25,919 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-02 04:57:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-12-02 04:57:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-12-02 04:57:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-02 04:57:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-12-02 04:57:25,983 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-12-02 04:57:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:25,983 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-12-02 04:57:25,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-12-02 04:57:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:57:25,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:25,986 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] [2018-12-02 04:57:25,986 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:25,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1225324604, now seen corresponding path program 1 times [2018-12-02 04:57:25,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:25,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:25,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:26,021 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-02 04:57:26,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:26,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:57:26,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:26,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:26,022 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-12-02 04:57:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:26,157 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-12-02 04:57:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:26,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-02 04:57:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:26,161 INFO L225 Difference]: With dead ends: 5732 [2018-12-02 04:57:26,161 INFO L226 Difference]: Without dead ends: 5698 [2018-12-02 04:57:26,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-02 04:57:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-12-02 04:57:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-12-02 04:57:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-02 04:57:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-12-02 04:57:26,200 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-12-02 04:57:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:26,201 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-12-02 04:57:26,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-12-02 04:57:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:57:26,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:26,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:26,204 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:26,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1401587043, now seen corresponding path program 1 times [2018-12-02 04:57:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:26,278 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-02 04:57:26,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:26,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:26,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:26,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:26,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:26,279 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-12-02 04:57:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:26,439 INFO L93 Difference]: Finished difference Result 6708 states and 15748 transitions. [2018-12-02 04:57:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:57:26,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 04:57:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:26,444 INFO L225 Difference]: With dead ends: 6708 [2018-12-02 04:57:26,444 INFO L226 Difference]: Without dead ends: 6676 [2018-12-02 04:57:26,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-02 04:57:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 5404. [2018-12-02 04:57:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-12-02 04:57:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 12732 transitions. [2018-12-02 04:57:26,485 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 12732 transitions. Word has length 82 [2018-12-02 04:57:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:26,485 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 12732 transitions. [2018-12-02 04:57:26,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 12732 transitions. [2018-12-02 04:57:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:57:26,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:26,488 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] [2018-12-02 04:57:26,488 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:26,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash -395364316, now seen corresponding path program 1 times [2018-12-02 04:57:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:26,541 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-02 04:57:26,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:26,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:57:26,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:26,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:57:26,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:57:26,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:26,542 INFO L87 Difference]: Start difference. First operand 5404 states and 12732 transitions. Second operand 7 states. [2018-12-02 04:57:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:26,757 INFO L93 Difference]: Finished difference Result 8734 states and 21012 transitions. [2018-12-02 04:57:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:57:26,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 04:57:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:26,763 INFO L225 Difference]: With dead ends: 8734 [2018-12-02 04:57:26,763 INFO L226 Difference]: Without dead ends: 8734 [2018-12-02 04:57:26,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:57:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2018-12-02 04:57:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6145. [2018-12-02 04:57:26,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-02 04:57:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 14616 transitions. [2018-12-02 04:57:26,818 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 14616 transitions. Word has length 82 [2018-12-02 04:57:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:26,819 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 14616 transitions. [2018-12-02 04:57:26,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:57:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 14616 transitions. [2018-12-02 04:57:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:57:26,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:26,822 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] [2018-12-02 04:57:26,823 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:26,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:26,823 INFO L82 PathProgramCache]: Analyzing trace with hash 492139365, now seen corresponding path program 1 times [2018-12-02 04:57:26,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:26,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:26,880 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-02 04:57:26,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:26,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:26,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:26,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:26,880 INFO L87 Difference]: Start difference. First operand 6145 states and 14616 transitions. Second operand 6 states. [2018-12-02 04:57:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:26,909 INFO L93 Difference]: Finished difference Result 7313 states and 17387 transitions. [2018-12-02 04:57:26,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:57:26,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 04:57:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:26,913 INFO L225 Difference]: With dead ends: 7313 [2018-12-02 04:57:26,914 INFO L226 Difference]: Without dead ends: 7313 [2018-12-02 04:57:26,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-02 04:57:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 5480. [2018-12-02 04:57:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2018-12-02 04:57:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12892 transitions. [2018-12-02 04:57:26,956 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12892 transitions. Word has length 82 [2018-12-02 04:57:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:26,956 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 12892 transitions. [2018-12-02 04:57:26,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12892 transitions. [2018-12-02 04:57:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 04:57:26,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:26,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:57:26,960 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:26,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1239836187, now seen corresponding path program 1 times [2018-12-02 04:57:26,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:26,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:27,011 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-02 04:57:27,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:27,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 04:57:27,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:27,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:57:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:57:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:57:27,012 INFO L87 Difference]: Start difference. First operand 5480 states and 12892 transitions. Second operand 6 states. [2018-12-02 04:57:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:27,082 INFO L93 Difference]: Finished difference Result 5096 states and 11724 transitions. [2018-12-02 04:57:27,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:57:27,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 04:57:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:27,086 INFO L225 Difference]: With dead ends: 5096 [2018-12-02 04:57:27,086 INFO L226 Difference]: Without dead ends: 5096 [2018-12-02 04:57:27,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:57:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2018-12-02 04:57:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 3190. [2018-12-02 04:57:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2018-12-02 04:57:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 7391 transitions. [2018-12-02 04:57:27,113 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 7391 transitions. Word has length 82 [2018-12-02 04:57:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:27,113 INFO L480 AbstractCegarLoop]: Abstraction has 3190 states and 7391 transitions. [2018-12-02 04:57:27,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 7391 transitions. [2018-12-02 04:57:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:27,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:27,115 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] [2018-12-02 04:57:27,115 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:27,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1939261575, now seen corresponding path program 1 times [2018-12-02 04:57:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:27,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:27,190 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-02 04:57:27,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:27,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:57:27,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:27,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:57:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:57:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:27,191 INFO L87 Difference]: Start difference. First operand 3190 states and 7391 transitions. Second operand 7 states. [2018-12-02 04:57:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:27,323 INFO L93 Difference]: Finished difference Result 3738 states and 8627 transitions. [2018-12-02 04:57:27,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:57:27,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 04:57:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:27,326 INFO L225 Difference]: With dead ends: 3738 [2018-12-02 04:57:27,326 INFO L226 Difference]: Without dead ends: 3738 [2018-12-02 04:57:27,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:57:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2018-12-02 04:57:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3641. [2018-12-02 04:57:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-12-02 04:57:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 8435 transitions. [2018-12-02 04:57:27,353 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 8435 transitions. Word has length 84 [2018-12-02 04:57:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:27,353 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 8435 transitions. [2018-12-02 04:57:27,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:57:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 8435 transitions. [2018-12-02 04:57:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:27,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:27,355 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] [2018-12-02 04:57:27,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:27,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1051757894, now seen corresponding path program 1 times [2018-12-02 04:57:27,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:27,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:27,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:27,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:27,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:27,434 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-02 04:57:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 04:57:27,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:27,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 04:57:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:57:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:57:27,435 INFO L87 Difference]: Start difference. First operand 3641 states and 8435 transitions. Second operand 10 states. [2018-12-02 04:57:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:28,137 INFO L93 Difference]: Finished difference Result 6341 states and 14692 transitions. [2018-12-02 04:57:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:57:28,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-02 04:57:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:28,140 INFO L225 Difference]: With dead ends: 6341 [2018-12-02 04:57:28,140 INFO L226 Difference]: Without dead ends: 4297 [2018-12-02 04:57:28,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 04:57:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2018-12-02 04:57:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 3676. [2018-12-02 04:57:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3676 states. [2018-12-02 04:57:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 8434 transitions. [2018-12-02 04:57:28,167 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 8434 transitions. Word has length 84 [2018-12-02 04:57:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:28,167 INFO L480 AbstractCegarLoop]: Abstraction has 3676 states and 8434 transitions. [2018-12-02 04:57:28,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 04:57:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 8434 transitions. [2018-12-02 04:57:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:28,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:28,170 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] [2018-12-02 04:57:28,170 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:28,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash 454383476, now seen corresponding path program 2 times [2018-12-02 04:57:28,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:28,236 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-02 04:57:28,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:28,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:57:28,236 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:28,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:57:28,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:57:28,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:57:28,237 INFO L87 Difference]: Start difference. First operand 3676 states and 8434 transitions. Second operand 8 states. [2018-12-02 04:57:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:28,581 INFO L93 Difference]: Finished difference Result 6529 states and 15057 transitions. [2018-12-02 04:57:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:28,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 04:57:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:28,584 INFO L225 Difference]: With dead ends: 6529 [2018-12-02 04:57:28,584 INFO L226 Difference]: Without dead ends: 2810 [2018-12-02 04:57:28,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:57:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2018-12-02 04:57:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2018-12-02 04:57:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2018-12-02 04:57:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6504 transitions. [2018-12-02 04:57:28,613 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6504 transitions. Word has length 84 [2018-12-02 04:57:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:28,613 INFO L480 AbstractCegarLoop]: Abstraction has 2810 states and 6504 transitions. [2018-12-02 04:57:28,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:57:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6504 transitions. [2018-12-02 04:57:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:28,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:28,616 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] [2018-12-02 04:57:28,616 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:28,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash 955940820, now seen corresponding path program 1 times [2018-12-02 04:57:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:57:28,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:28,679 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-02 04:57:28,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:28,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:57:28,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:28,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:57:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:57:28,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:28,680 INFO L87 Difference]: Start difference. First operand 2810 states and 6504 transitions. Second operand 7 states. [2018-12-02 04:57:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:28,880 INFO L93 Difference]: Finished difference Result 3247 states and 7538 transitions. [2018-12-02 04:57:28,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:57:28,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 04:57:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:28,882 INFO L225 Difference]: With dead ends: 3247 [2018-12-02 04:57:28,882 INFO L226 Difference]: Without dead ends: 3247 [2018-12-02 04:57:28,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2018-12-02 04:57:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2890. [2018-12-02 04:57:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-02 04:57:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 6729 transitions. [2018-12-02 04:57:28,901 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 6729 transitions. Word has length 84 [2018-12-02 04:57:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:28,902 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 6729 transitions. [2018-12-02 04:57:28,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:57:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 6729 transitions. [2018-12-02 04:57:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:28,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:28,903 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] [2018-12-02 04:57:28,904 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:28,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1237296374, now seen corresponding path program 1 times [2018-12-02 04:57:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:28,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:28,986 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-02 04:57:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:28,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:57:28,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:28,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:57:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:57:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:28,987 INFO L87 Difference]: Start difference. First operand 2890 states and 6729 transitions. Second operand 7 states. [2018-12-02 04:57:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:29,106 INFO L93 Difference]: Finished difference Result 3006 states and 6922 transitions. [2018-12-02 04:57:29,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:57:29,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-02 04:57:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:29,108 INFO L225 Difference]: With dead ends: 3006 [2018-12-02 04:57:29,108 INFO L226 Difference]: Without dead ends: 3006 [2018-12-02 04:57:29,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:57:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2018-12-02 04:57:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2728. [2018-12-02 04:57:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-12-02 04:57:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 6289 transitions. [2018-12-02 04:57:29,126 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 6289 transitions. Word has length 84 [2018-12-02 04:57:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:29,126 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 6289 transitions. [2018-12-02 04:57:29,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:57:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 6289 transitions. [2018-12-02 04:57:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:29,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:29,128 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] [2018-12-02 04:57:29,128 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:29,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1448647287, now seen corresponding path program 2 times [2018-12-02 04:57:29,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:29,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:29,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:57:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 04:57:29,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:29,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 04:57:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:57:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:57:29,203 INFO L87 Difference]: Start difference. First operand 2728 states and 6289 transitions. Second operand 8 states. [2018-12-02 04:57:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:29,342 INFO L93 Difference]: Finished difference Result 3112 states and 7156 transitions. [2018-12-02 04:57:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:57:29,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-02 04:57:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:29,344 INFO L225 Difference]: With dead ends: 3112 [2018-12-02 04:57:29,344 INFO L226 Difference]: Without dead ends: 3112 [2018-12-02 04:57:29,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:57:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-12-02 04:57:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2751. [2018-12-02 04:57:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2751 states. [2018-12-02 04:57:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 6330 transitions. [2018-12-02 04:57:29,364 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 6330 transitions. Word has length 84 [2018-12-02 04:57:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 2751 states and 6330 transitions. [2018-12-02 04:57:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 04:57:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 6330 transitions. [2018-12-02 04:57:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:29,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:29,365 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] [2018-12-02 04:57:29,366 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:29,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1958816328, now seen corresponding path program 3 times [2018-12-02 04:57:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:57:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:29,434 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-02 04:57:29,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:29,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 04:57:29,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:57:29,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 04:57:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 04:57:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:57:29,435 INFO L87 Difference]: Start difference. First operand 2751 states and 6330 transitions. Second operand 11 states. [2018-12-02 04:57:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:29,894 INFO L93 Difference]: Finished difference Result 4763 states and 11016 transitions. [2018-12-02 04:57:29,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 04:57:29,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-02 04:57:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:29,897 INFO L225 Difference]: With dead ends: 4763 [2018-12-02 04:57:29,897 INFO L226 Difference]: Without dead ends: 3059 [2018-12-02 04:57:29,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 04:57:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-12-02 04:57:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2018-12-02 04:57:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-02 04:57:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 6288 transitions. [2018-12-02 04:57:29,916 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 6288 transitions. Word has length 84 [2018-12-02 04:57:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:29,916 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 6288 transitions. [2018-12-02 04:57:29,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 04:57:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 6288 transitions. [2018-12-02 04:57:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 04:57:29,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:29,918 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] [2018-12-02 04:57:29,918 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:29,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 10917176, now seen corresponding path program 4 times [2018-12-02 04:57:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:57:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:57:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:29,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:57:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:57:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:57:29,957 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:57:30,036 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 04:57:30,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:57:30 BasicIcfg [2018-12-02 04:57:30,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:57:30,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:57:30,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:57:30,038 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:57:30,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:57:10" (3/4) ... [2018-12-02 04:57:30,040 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 04:57:30,124 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_12f2a1ad-50b7-4b15-875b-b8834b6890ca/bin-2019/utaipan/witness.graphml [2018-12-02 04:57:30,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:57:30,125 INFO L168 Benchmark]: Toolchain (without parser) took 20628.64 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 947.0 MB in the beginning and 1.5 GB in the end (delta: -575.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,126 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:57:30,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,127 INFO L168 Benchmark]: Boogie Preprocessor took 18.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,127 INFO L168 Benchmark]: RCFGBuilder took 323.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,128 INFO L168 Benchmark]: TraceAbstraction took 19805.05 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -520.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,128 INFO L168 Benchmark]: Witness Printer took 87.13 ms. Allocated memory is still 3.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:30,130 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19805.05 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -520.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 87.13 ms. Allocated memory is still 3.7 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L776] -1 pthread_t t1639; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L777] FCALL, FORK -1 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L778] -1 pthread_t t1640; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L779] FCALL, FORK -1 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -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) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -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 [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -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 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 19.7s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8043 SDtfs, 9887 SDslu, 19304 SDs, 0 SdLazy, 7859 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 75 SyntacticMatches, 24 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, 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: 7.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 147550 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2132 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 380616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...