./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.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_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/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 fcb329b6c3e1844226c37897e0522d1de6ff320a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:31:55,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:31:55,650 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:31:55,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:31:55,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:31:55,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:31:55,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:31:55,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:31:55,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:31:55,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:31:55,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:31:55,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:31:55,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:31:55,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:31:55,665 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:31:55,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:31:55,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:31:55,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:31:55,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:31:55,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:31:55,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:31:55,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:31:55,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:31:55,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:31:55,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:31:55,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:31:55,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:31:55,672 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:31:55,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:31:55,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:31:55,674 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:31:55,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:31:55,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:31:55,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:31:55,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:31:55,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:31:55,676 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:31:55,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:31:55,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:31:55,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:31:55,687 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:31:55,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:31:55,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:31:55,687 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:31:55,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:31:55,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:31:55,688 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:31:55,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:31:55,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:31:55,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:31:55,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:31:55,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:31:55,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:31:55,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:31:55,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:31:55,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:31:55,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:31:55,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:31:55,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:31:55,691 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:31:55,692 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:31:55,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:31:55,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:31:55,692 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_0f1b4112-6d63-426b-b033-8ca6369a1841/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 -> fcb329b6c3e1844226c37897e0522d1de6ff320a [2018-12-09 17:31:55,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:31:55,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:31:55,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:31:55,723 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:31:55,724 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:31:55,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc_false-unreach-call.i [2018-12-09 17:31:55,758 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/data/fb32dc639/d24a1fdff01e4776a1cdb75630472618/FLAGfa347b528 [2018-12-09 17:31:56,150 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:31:56,150 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc_false-unreach-call.i [2018-12-09 17:31:56,158 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/data/fb32dc639/d24a1fdff01e4776a1cdb75630472618/FLAGfa347b528 [2018-12-09 17:31:56,490 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/data/fb32dc639/d24a1fdff01e4776a1cdb75630472618 [2018-12-09 17:31:56,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:31:56,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:31:56,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:31:56,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:31:56,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:31:56,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38aff2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56, skipping insertion in model container [2018-12-09 17:31:56,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:31:56,542 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:31:56,713 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:31:56,722 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:31:56,799 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:31:56,845 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:31:56,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56 WrapperNode [2018-12-09 17:31:56,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:31:56,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:31:56,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:31:56,847 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:31:56,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:31:56,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:31:56,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:31:56,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:31:56,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... [2018-12-09 17:31:56,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:31:56,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:31:56,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:31:56,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:31:56,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:31:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:31:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 17:31:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 17:31:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:31:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 17:31:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 17:31:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 17:31:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 17:31:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 17:31:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:31:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:31:56,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-09 17:31:57,228 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:31:57,228 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 17:31:57,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57 BoogieIcfgContainer [2018-12-09 17:31:57,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:31:57,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:31:57,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:31:57,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:31:57,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:31:56" (1/3) ... [2018-12-09 17:31:57,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66264b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:57, skipping insertion in model container [2018-12-09 17:31:57,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:31:56" (2/3) ... [2018-12-09 17:31:57,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66264b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:31:57, skipping insertion in model container [2018-12-09 17:31:57,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57" (3/3) ... [2018-12-09 17:31:57,233 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.oepc_false-unreach-call.i [2018-12-09 17:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,255 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,255 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,256 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,261 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,262 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,263 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,264 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,265 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,266 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,267 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,268 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,269 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 17:31:57,277 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 17:31:57,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:31:57,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 17:31:57,291 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 17:31:57,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:31:57,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:31:57,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:31:57,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:31:57,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:31:57,306 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:31:57,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:31:57,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:31:57,312 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-09 17:31:58,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-09 17:31:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-09 17:31:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 17:31:58,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:31:58,390 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] [2018-12-09 17:31:58,392 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:31:58,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:31:58,395 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-09 17:31:58,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:31:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:31:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:58,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:31:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:31:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:31:58,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:31:58,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:31:58,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:31:58,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:31:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:31:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:31:58,568 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-09 17:31:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:31:58,939 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-09 17:31:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:31:58,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-09 17:31:58,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:31:59,062 INFO L225 Difference]: With dead ends: 47768 [2018-12-09 17:31:59,062 INFO L226 Difference]: Without dead ends: 34608 [2018-12-09 17:31:59,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:31:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-09 17:31:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-09 17:31:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-09 17:31:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-09 17:31:59,697 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-09 17:31:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:31:59,697 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-09 17:31:59,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:31:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-09 17:31:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 17:31:59,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:31:59,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:31:59,702 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:31:59,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:31:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-09 17:31:59,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:31:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:59,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:31:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:59,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:31:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:31:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:31:59,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:31:59,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:31:59,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:31:59,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:31:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:31:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:31:59,752 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 4 states. [2018-12-09 17:31:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:31:59,811 INFO L93 Difference]: Finished difference Result 7170 states and 23626 transitions. [2018-12-09 17:31:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:31:59,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 17:31:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:31:59,825 INFO L225 Difference]: With dead ends: 7170 [2018-12-09 17:31:59,825 INFO L226 Difference]: Without dead ends: 6324 [2018-12-09 17:31:59,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:31:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2018-12-09 17:31:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 6324. [2018-12-09 17:31:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6324 states. [2018-12-09 17:31:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 20698 transitions. [2018-12-09 17:31:59,971 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 20698 transitions. Word has length 47 [2018-12-09 17:31:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:31:59,971 INFO L480 AbstractCegarLoop]: Abstraction has 6324 states and 20698 transitions. [2018-12-09 17:31:59,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:31:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 20698 transitions. [2018-12-09 17:31:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 17:31:59,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:31:59,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:31:59,973 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:31:59,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:31:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1786960607, now seen corresponding path program 1 times [2018-12-09 17:31:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:31:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:59,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:31:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:31:59,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:31:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:00,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:00,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:00,036 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:00,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:00,037 INFO L87 Difference]: Start difference. First operand 6324 states and 20698 transitions. Second operand 5 states. [2018-12-09 17:32:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:00,217 INFO L93 Difference]: Finished difference Result 12020 states and 38784 transitions. [2018-12-09 17:32:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:32:00,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 17:32:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:00,231 INFO L225 Difference]: With dead ends: 12020 [2018-12-09 17:32:00,231 INFO L226 Difference]: Without dead ends: 11945 [2018-12-09 17:32:00,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:32:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11945 states. [2018-12-09 17:32:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11945 to 8289. [2018-12-09 17:32:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2018-12-09 17:32:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 26551 transitions. [2018-12-09 17:32:00,341 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 26551 transitions. Word has length 48 [2018-12-09 17:32:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:00,341 INFO L480 AbstractCegarLoop]: Abstraction has 8289 states and 26551 transitions. [2018-12-09 17:32:00,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 26551 transitions. [2018-12-09 17:32:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 17:32:00,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:00,342 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] [2018-12-09 17:32:00,343 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-09 17:32:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:00,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:00,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:32:00,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:32:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:32:00,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:32:00,376 INFO L87 Difference]: Start difference. First operand 8289 states and 26551 transitions. Second operand 3 states. [2018-12-09 17:32:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:00,435 INFO L93 Difference]: Finished difference Result 10985 states and 34706 transitions. [2018-12-09 17:32:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:32:00,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 17:32:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:00,447 INFO L225 Difference]: With dead ends: 10985 [2018-12-09 17:32:00,447 INFO L226 Difference]: Without dead ends: 10981 [2018-12-09 17:32:00,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:32:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10981 states. [2018-12-09 17:32:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10981 to 8507. [2018-12-09 17:32:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8507 states. [2018-12-09 17:32:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 26987 transitions. [2018-12-09 17:32:00,543 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 26987 transitions. Word has length 50 [2018-12-09 17:32:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:00,543 INFO L480 AbstractCegarLoop]: Abstraction has 8507 states and 26987 transitions. [2018-12-09 17:32:00,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:32:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 26987 transitions. [2018-12-09 17:32:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 17:32:00,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:00,544 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] [2018-12-09 17:32:00,544 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:00,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-09 17:32:00,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:00,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:00,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:00,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:00,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:00,600 INFO L87 Difference]: Start difference. First operand 8507 states and 26987 transitions. Second operand 6 states. [2018-12-09 17:32:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:00,834 INFO L93 Difference]: Finished difference Result 11923 states and 37198 transitions. [2018-12-09 17:32:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:32:00,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 17:32:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:00,846 INFO L225 Difference]: With dead ends: 11923 [2018-12-09 17:32:00,846 INFO L226 Difference]: Without dead ends: 11826 [2018-12-09 17:32:00,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:32:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2018-12-09 17:32:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 9281. [2018-12-09 17:32:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9281 states. [2018-12-09 17:32:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 29431 transitions. [2018-12-09 17:32:01,031 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 29431 transitions. Word has length 54 [2018-12-09 17:32:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:01,031 INFO L480 AbstractCegarLoop]: Abstraction has 9281 states and 29431 transitions. [2018-12-09 17:32:01,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 29431 transitions. [2018-12-09 17:32:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 17:32:01,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:01,036 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] [2018-12-09 17:32:01,036 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:01,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash -564402918, now seen corresponding path program 1 times [2018-12-09 17:32:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:01,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:01,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:32:01,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:01,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:32:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:32:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:32:01,093 INFO L87 Difference]: Start difference. First operand 9281 states and 29431 transitions. Second operand 4 states. [2018-12-09 17:32:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:01,179 INFO L93 Difference]: Finished difference Result 10900 states and 34382 transitions. [2018-12-09 17:32:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:32:01,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 17:32:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:01,191 INFO L225 Difference]: With dead ends: 10900 [2018-12-09 17:32:01,191 INFO L226 Difference]: Without dead ends: 10900 [2018-12-09 17:32:01,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10900 states. [2018-12-09 17:32:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10900 to 9932. [2018-12-09 17:32:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9932 states. [2018-12-09 17:32:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 31408 transitions. [2018-12-09 17:32:01,295 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 31408 transitions. Word has length 64 [2018-12-09 17:32:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:01,295 INFO L480 AbstractCegarLoop]: Abstraction has 9932 states and 31408 transitions. [2018-12-09 17:32:01,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:32:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 31408 transitions. [2018-12-09 17:32:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 17:32:01,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:01,300 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] [2018-12-09 17:32:01,300 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:01,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1178407417, now seen corresponding path program 1 times [2018-12-09 17:32:01,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:01,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:01,336 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:01,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:01,337 INFO L87 Difference]: Start difference. First operand 9932 states and 31408 transitions. Second operand 6 states. [2018-12-09 17:32:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:01,654 INFO L93 Difference]: Finished difference Result 21763 states and 67780 transitions. [2018-12-09 17:32:01,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 17:32:01,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 17:32:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:01,676 INFO L225 Difference]: With dead ends: 21763 [2018-12-09 17:32:01,677 INFO L226 Difference]: Without dead ends: 21699 [2018-12-09 17:32:01,677 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-09 17:32:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21699 states. [2018-12-09 17:32:01,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21699 to 13157. [2018-12-09 17:32:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13157 states. [2018-12-09 17:32:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 40989 transitions. [2018-12-09 17:32:01,850 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 40989 transitions. Word has length 64 [2018-12-09 17:32:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:01,851 INFO L480 AbstractCegarLoop]: Abstraction has 13157 states and 40989 transitions. [2018-12-09 17:32:01,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 40989 transitions. [2018-12-09 17:32:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 17:32:01,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:01,857 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] [2018-12-09 17:32:01,857 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:01,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash 708445986, now seen corresponding path program 1 times [2018-12-09 17:32:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:01,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:01,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:01,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:01,920 INFO L87 Difference]: Start difference. First operand 13157 states and 40989 transitions. Second operand 5 states. [2018-12-09 17:32:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:02,179 INFO L93 Difference]: Finished difference Result 19275 states and 58649 transitions. [2018-12-09 17:32:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:32:02,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2018-12-09 17:32:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:02,200 INFO L225 Difference]: With dead ends: 19275 [2018-12-09 17:32:02,200 INFO L226 Difference]: Without dead ends: 19275 [2018-12-09 17:32:02,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2018-12-09 17:32:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 14988. [2018-12-09 17:32:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2018-12-09 17:32:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46076 transitions. [2018-12-09 17:32:02,367 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46076 transitions. Word has length 66 [2018-12-09 17:32:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:02,367 INFO L480 AbstractCegarLoop]: Abstraction has 14988 states and 46076 transitions. [2018-12-09 17:32:02,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46076 transitions. [2018-12-09 17:32:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 17:32:02,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:02,374 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] [2018-12-09 17:32:02,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:02,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:02,375 INFO L82 PathProgramCache]: Analyzing trace with hash 497095073, now seen corresponding path program 1 times [2018-12-09 17:32:02,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:02,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:02,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:02,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:02,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:32:02,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:02,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:32:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:32:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:32:02,418 INFO L87 Difference]: Start difference. First operand 14988 states and 46076 transitions. Second operand 4 states. [2018-12-09 17:32:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:02,596 INFO L93 Difference]: Finished difference Result 18810 states and 57063 transitions. [2018-12-09 17:32:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 17:32:02,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 17:32:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:02,619 INFO L225 Difference]: With dead ends: 18810 [2018-12-09 17:32:02,619 INFO L226 Difference]: Without dead ends: 18810 [2018-12-09 17:32:02,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:32:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18810 states. [2018-12-09 17:32:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18810 to 15263. [2018-12-09 17:32:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15263 states. [2018-12-09 17:32:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15263 states to 15263 states and 46864 transitions. [2018-12-09 17:32:02,792 INFO L78 Accepts]: Start accepts. Automaton has 15263 states and 46864 transitions. Word has length 66 [2018-12-09 17:32:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:02,793 INFO L480 AbstractCegarLoop]: Abstraction has 15263 states and 46864 transitions. [2018-12-09 17:32:02,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:32:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15263 states and 46864 transitions. [2018-12-09 17:32:02,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 17:32:02,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:02,800 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] [2018-12-09 17:32:02,800 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:02,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1580114270, now seen corresponding path program 1 times [2018-12-09 17:32:02,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:02,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:02,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:02,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:32:02,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:02,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:32:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:32:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:32:02,820 INFO L87 Difference]: Start difference. First operand 15263 states and 46864 transitions. Second operand 3 states. [2018-12-09 17:32:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:02,938 INFO L93 Difference]: Finished difference Result 15699 states and 48054 transitions. [2018-12-09 17:32:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:32:02,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 17:32:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:02,955 INFO L225 Difference]: With dead ends: 15699 [2018-12-09 17:32:02,955 INFO L226 Difference]: Without dead ends: 15699 [2018-12-09 17:32:02,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:32:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15699 states. [2018-12-09 17:32:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15699 to 15481. [2018-12-09 17:32:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15481 states. [2018-12-09 17:32:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 47432 transitions. [2018-12-09 17:32:03,135 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 47432 transitions. Word has length 66 [2018-12-09 17:32:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:03,136 INFO L480 AbstractCegarLoop]: Abstraction has 15481 states and 47432 transitions. [2018-12-09 17:32:03,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:32:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 47432 transitions. [2018-12-09 17:32:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:03,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:03,144 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] [2018-12-09 17:32:03,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:03,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1496622296, now seen corresponding path program 1 times [2018-12-09 17:32:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:03,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:03,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:03,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:03,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:03,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:03,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:03,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:03,197 INFO L87 Difference]: Start difference. First operand 15481 states and 47432 transitions. Second operand 6 states. [2018-12-09 17:32:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:03,687 INFO L93 Difference]: Finished difference Result 18701 states and 56367 transitions. [2018-12-09 17:32:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:32:03,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:32:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:03,709 INFO L225 Difference]: With dead ends: 18701 [2018-12-09 17:32:03,709 INFO L226 Difference]: Without dead ends: 18701 [2018-12-09 17:32:03,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:32:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18701 states. [2018-12-09 17:32:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18701 to 17377. [2018-12-09 17:32:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2018-12-09 17:32:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 52698 transitions. [2018-12-09 17:32:03,905 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 52698 transitions. Word has length 68 [2018-12-09 17:32:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:03,905 INFO L480 AbstractCegarLoop]: Abstraction has 17377 states and 52698 transitions. [2018-12-09 17:32:03,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 52698 transitions. [2018-12-09 17:32:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:03,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:03,915 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] [2018-12-09 17:32:03,916 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:03,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 721135657, now seen corresponding path program 1 times [2018-12-09 17:32:03,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:03,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:03,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:03,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:03,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:03,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:03,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:03,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:03,973 INFO L87 Difference]: Start difference. First operand 17377 states and 52698 transitions. Second operand 6 states. [2018-12-09 17:32:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:04,186 INFO L93 Difference]: Finished difference Result 19150 states and 57148 transitions. [2018-12-09 17:32:04,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:32:04,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:32:04,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:04,205 INFO L225 Difference]: With dead ends: 19150 [2018-12-09 17:32:04,205 INFO L226 Difference]: Without dead ends: 19150 [2018-12-09 17:32:04,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:32:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2018-12-09 17:32:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 17509. [2018-12-09 17:32:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2018-12-09 17:32:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 52637 transitions. [2018-12-09 17:32:04,381 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 52637 transitions. Word has length 68 [2018-12-09 17:32:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:04,381 INFO L480 AbstractCegarLoop]: Abstraction has 17509 states and 52637 transitions. [2018-12-09 17:32:04,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 52637 transitions. [2018-12-09 17:32:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:04,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:04,391 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] [2018-12-09 17:32:04,391 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:04,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 932486570, now seen corresponding path program 1 times [2018-12-09 17:32:04,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:04,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:04,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:04,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:04,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:04,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:04,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:04,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:04,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:04,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:04,428 INFO L87 Difference]: Start difference. First operand 17509 states and 52637 transitions. Second operand 5 states. [2018-12-09 17:32:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:04,614 INFO L93 Difference]: Finished difference Result 21589 states and 64352 transitions. [2018-12-09 17:32:04,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:32:04,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:32:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:04,638 INFO L225 Difference]: With dead ends: 21589 [2018-12-09 17:32:04,638 INFO L226 Difference]: Without dead ends: 21589 [2018-12-09 17:32:04,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:32:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2018-12-09 17:32:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 18595. [2018-12-09 17:32:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18595 states. [2018-12-09 17:32:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18595 states to 18595 states and 55396 transitions. [2018-12-09 17:32:04,840 INFO L78 Accepts]: Start accepts. Automaton has 18595 states and 55396 transitions. Word has length 68 [2018-12-09 17:32:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:04,841 INFO L480 AbstractCegarLoop]: Abstraction has 18595 states and 55396 transitions. [2018-12-09 17:32:04,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18595 states and 55396 transitions. [2018-12-09 17:32:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:04,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:04,851 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] [2018-12-09 17:32:04,851 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 421952393, now seen corresponding path program 1 times [2018-12-09 17:32:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:04,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:04,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:04,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:04,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:04,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:04,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:04,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:04,900 INFO L87 Difference]: Start difference. First operand 18595 states and 55396 transitions. Second operand 5 states. [2018-12-09 17:32:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:05,166 INFO L93 Difference]: Finished difference Result 27216 states and 80202 transitions. [2018-12-09 17:32:05,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:32:05,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:32:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:05,191 INFO L225 Difference]: With dead ends: 27216 [2018-12-09 17:32:05,192 INFO L226 Difference]: Without dead ends: 27216 [2018-12-09 17:32:05,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:32:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2018-12-09 17:32:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 21398. [2018-12-09 17:32:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2018-12-09 17:32:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 63361 transitions. [2018-12-09 17:32:05,415 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 63361 transitions. Word has length 68 [2018-12-09 17:32:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:05,416 INFO L480 AbstractCegarLoop]: Abstraction has 21398 states and 63361 transitions. [2018-12-09 17:32:05,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 63361 transitions. [2018-12-09 17:32:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:05,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:05,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:05,426 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:05,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:05,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-09 17:32:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:05,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:05,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:05,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:05,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:05,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:05,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:05,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:05,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:05,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:05,475 INFO L87 Difference]: Start difference. First operand 21398 states and 63361 transitions. Second operand 6 states. [2018-12-09 17:32:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:05,875 INFO L93 Difference]: Finished difference Result 35018 states and 103808 transitions. [2018-12-09 17:32:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:32:05,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 17:32:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:05,911 INFO L225 Difference]: With dead ends: 35018 [2018-12-09 17:32:05,911 INFO L226 Difference]: Without dead ends: 35018 [2018-12-09 17:32:05,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:32:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2018-12-09 17:32:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 27706. [2018-12-09 17:32:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27706 states. [2018-12-09 17:32:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27706 states to 27706 states and 83160 transitions. [2018-12-09 17:32:06,242 INFO L78 Accepts]: Start accepts. Automaton has 27706 states and 83160 transitions. Word has length 68 [2018-12-09 17:32:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:06,242 INFO L480 AbstractCegarLoop]: Abstraction has 27706 states and 83160 transitions. [2018-12-09 17:32:06,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27706 states and 83160 transitions. [2018-12-09 17:32:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:06,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:06,256 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] [2018-12-09 17:32:06,256 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:06,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-09 17:32:06,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:06,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:06,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:06,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:06,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:06,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:06,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:32:06,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:06,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 17:32:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 17:32:06,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 17:32:06,295 INFO L87 Difference]: Start difference. First operand 27706 states and 83160 transitions. Second operand 4 states. [2018-12-09 17:32:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:06,589 INFO L93 Difference]: Finished difference Result 30486 states and 90397 transitions. [2018-12-09 17:32:06,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:32:06,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 17:32:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:06,622 INFO L225 Difference]: With dead ends: 30486 [2018-12-09 17:32:06,623 INFO L226 Difference]: Without dead ends: 29906 [2018-12-09 17:32:06,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2018-12-09 17:32:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 27610. [2018-12-09 17:32:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-12-09 17:32:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 82079 transitions. [2018-12-09 17:32:06,993 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 82079 transitions. Word has length 68 [2018-12-09 17:32:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:06,994 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 82079 transitions. [2018-12-09 17:32:06,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 17:32:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 82079 transitions. [2018-12-09 17:32:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:07,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:07,009 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] [2018-12-09 17:32:07,009 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-09 17:32:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:07,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:07,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:32:07,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:07,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:32:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:32:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:32:07,138 INFO L87 Difference]: Start difference. First operand 27610 states and 82079 transitions. Second operand 9 states. [2018-12-09 17:32:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:07,514 INFO L93 Difference]: Finished difference Result 34850 states and 102928 transitions. [2018-12-09 17:32:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 17:32:07,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 17:32:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:07,552 INFO L225 Difference]: With dead ends: 34850 [2018-12-09 17:32:07,552 INFO L226 Difference]: Without dead ends: 34850 [2018-12-09 17:32:07,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:32:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34850 states. [2018-12-09 17:32:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34850 to 29288. [2018-12-09 17:32:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29288 states. [2018-12-09 17:32:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29288 states to 29288 states and 87100 transitions. [2018-12-09 17:32:07,884 INFO L78 Accepts]: Start accepts. Automaton has 29288 states and 87100 transitions. Word has length 68 [2018-12-09 17:32:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:07,884 INFO L480 AbstractCegarLoop]: Abstraction has 29288 states and 87100 transitions. [2018-12-09 17:32:07,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:32:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 29288 states and 87100 transitions. [2018-12-09 17:32:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 17:32:07,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:07,897 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] [2018-12-09 17:32:07,897 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:07,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-09 17:32:07,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:07,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:07,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:07,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:07,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:07,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:07,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:07,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:07,943 INFO L87 Difference]: Start difference. First operand 29288 states and 87100 transitions. Second operand 5 states. [2018-12-09 17:32:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:07,974 INFO L93 Difference]: Finished difference Result 7664 states and 18502 transitions. [2018-12-09 17:32:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:32:07,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 17:32:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:07,978 INFO L225 Difference]: With dead ends: 7664 [2018-12-09 17:32:07,978 INFO L226 Difference]: Without dead ends: 5913 [2018-12-09 17:32:07,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:32:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2018-12-09 17:32:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 4971. [2018-12-09 17:32:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2018-12-09 17:32:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 11771 transitions. [2018-12-09 17:32:08,012 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 11771 transitions. Word has length 68 [2018-12-09 17:32:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:08,013 INFO L480 AbstractCegarLoop]: Abstraction has 4971 states and 11771 transitions. [2018-12-09 17:32:08,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 11771 transitions. [2018-12-09 17:32:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:08,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:08,016 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] [2018-12-09 17:32:08,016 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:08,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash -192623053, now seen corresponding path program 1 times [2018-12-09 17:32:08,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:08,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:08,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:08,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:08,055 INFO L87 Difference]: Start difference. First operand 4971 states and 11771 transitions. Second operand 5 states. [2018-12-09 17:32:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:08,179 INFO L93 Difference]: Finished difference Result 6177 states and 14425 transitions. [2018-12-09 17:32:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:32:08,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-09 17:32:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:08,183 INFO L225 Difference]: With dead ends: 6177 [2018-12-09 17:32:08,183 INFO L226 Difference]: Without dead ends: 6143 [2018-12-09 17:32:08,184 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-09 17:32:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2018-12-09 17:32:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 5262. [2018-12-09 17:32:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5262 states. [2018-12-09 17:32:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 12356 transitions. [2018-12-09 17:32:08,221 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 12356 transitions. Word has length 83 [2018-12-09 17:32:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:08,222 INFO L480 AbstractCegarLoop]: Abstraction has 5262 states and 12356 transitions. [2018-12-09 17:32:08,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 12356 transitions. [2018-12-09 17:32:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:08,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:08,225 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] [2018-12-09 17:32:08,225 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:08,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash -427244149, now seen corresponding path program 2 times [2018-12-09 17:32:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:08,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-09 17:32:08,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:08,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:08,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:08,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:08,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:08,279 INFO L87 Difference]: Start difference. First operand 5262 states and 12356 transitions. Second operand 6 states. [2018-12-09 17:32:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:08,448 INFO L93 Difference]: Finished difference Result 7071 states and 16571 transitions. [2018-12-09 17:32:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:32:08,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 17:32:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:08,453 INFO L225 Difference]: With dead ends: 7071 [2018-12-09 17:32:08,453 INFO L226 Difference]: Without dead ends: 7039 [2018-12-09 17:32:08,453 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-09 17:32:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7039 states. [2018-12-09 17:32:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7039 to 5567. [2018-12-09 17:32:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5567 states. [2018-12-09 17:32:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 13121 transitions. [2018-12-09 17:32:08,494 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 13121 transitions. Word has length 83 [2018-12-09 17:32:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:08,495 INFO L480 AbstractCegarLoop]: Abstraction has 5567 states and 13121 transitions. [2018-12-09 17:32:08,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 13121 transitions. [2018-12-09 17:32:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:08,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:08,498 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] [2018-12-09 17:32:08,498 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:08,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2070771788, now seen corresponding path program 1 times [2018-12-09 17:32:08,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:32:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:08,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:08,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:32:08,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:08,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:32:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:32:08,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:32:08,552 INFO L87 Difference]: Start difference. First operand 5567 states and 13121 transitions. Second operand 7 states. [2018-12-09 17:32:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:08,794 INFO L93 Difference]: Finished difference Result 8508 states and 20474 transitions. [2018-12-09 17:32:08,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 17:32:08,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-12-09 17:32:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:08,799 INFO L225 Difference]: With dead ends: 8508 [2018-12-09 17:32:08,800 INFO L226 Difference]: Without dead ends: 8508 [2018-12-09 17:32:08,800 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-09 17:32:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-12-09 17:32:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6212. [2018-12-09 17:32:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2018-12-09 17:32:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 14765 transitions. [2018-12-09 17:32:08,855 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 14765 transitions. Word has length 83 [2018-12-09 17:32:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 6212 states and 14765 transitions. [2018-12-09 17:32:08,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:32:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 14765 transitions. [2018-12-09 17:32:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:08,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:08,860 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] [2018-12-09 17:32:08,860 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:08,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1336691827, now seen corresponding path program 1 times [2018-12-09 17:32:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:08,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:08,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:08,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:08,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:08,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:08,920 INFO L87 Difference]: Start difference. First operand 6212 states and 14765 transitions. Second operand 6 states. [2018-12-09 17:32:09,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:09,152 INFO L93 Difference]: Finished difference Result 6675 states and 15954 transitions. [2018-12-09 17:32:09,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:32:09,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 17:32:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:09,157 INFO L225 Difference]: With dead ends: 6675 [2018-12-09 17:32:09,157 INFO L226 Difference]: Without dead ends: 6675 [2018-12-09 17:32:09,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:32:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6675 states. [2018-12-09 17:32:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6675 to 5480. [2018-12-09 17:32:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2018-12-09 17:32:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12981 transitions. [2018-12-09 17:32:09,204 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12981 transitions. Word has length 83 [2018-12-09 17:32:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:09,204 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 12981 transitions. [2018-12-09 17:32:09,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12981 transitions. [2018-12-09 17:32:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:09,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:09,208 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] [2018-12-09 17:32:09,209 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:09,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:09,209 INFO L82 PathProgramCache]: Analyzing trace with hash -858977808, now seen corresponding path program 1 times [2018-12-09 17:32:09,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:09,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:09,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:09,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:09,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:09,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:09,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:09,255 INFO L87 Difference]: Start difference. First operand 5480 states and 12981 transitions. Second operand 6 states. [2018-12-09 17:32:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:09,386 INFO L93 Difference]: Finished difference Result 6488 states and 15322 transitions. [2018-12-09 17:32:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:32:09,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 17:32:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:09,391 INFO L225 Difference]: With dead ends: 6488 [2018-12-09 17:32:09,391 INFO L226 Difference]: Without dead ends: 6488 [2018-12-09 17:32:09,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6488 states. [2018-12-09 17:32:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6488 to 5340. [2018-12-09 17:32:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5340 states. [2018-12-09 17:32:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5340 states to 5340 states and 12624 transitions. [2018-12-09 17:32:09,441 INFO L78 Accepts]: Start accepts. Automaton has 5340 states and 12624 transitions. Word has length 83 [2018-12-09 17:32:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:09,441 INFO L480 AbstractCegarLoop]: Abstraction has 5340 states and 12624 transitions. [2018-12-09 17:32:09,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 12624 transitions. [2018-12-09 17:32:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 17:32:09,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:09,444 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] [2018-12-09 17:32:09,444 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 510429518, now seen corresponding path program 1 times [2018-12-09 17:32:09,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:09,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:09,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:09,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:32:09,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:09,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:32:09,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:32:09,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:09,503 INFO L87 Difference]: Start difference. First operand 5340 states and 12624 transitions. Second operand 6 states. [2018-12-09 17:32:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:09,577 INFO L93 Difference]: Finished difference Result 4988 states and 11472 transitions. [2018-12-09 17:32:09,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:32:09,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-09 17:32:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:09,580 INFO L225 Difference]: With dead ends: 4988 [2018-12-09 17:32:09,580 INFO L226 Difference]: Without dead ends: 4988 [2018-12-09 17:32:09,581 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-09 17:32:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2018-12-09 17:32:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 2987. [2018-12-09 17:32:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2018-12-09 17:32:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 6877 transitions. [2018-12-09 17:32:09,607 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 6877 transitions. Word has length 83 [2018-12-09 17:32:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:09,607 INFO L480 AbstractCegarLoop]: Abstraction has 2987 states and 6877 transitions. [2018-12-09 17:32:09,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:32:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 6877 transitions. [2018-12-09 17:32:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:09,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:09,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:09,610 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:09,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2052881326, now seen corresponding path program 1 times [2018-12-09 17:32:09,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:09,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:09,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:09,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:32:09,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:09,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:32:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:32:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:32:09,695 INFO L87 Difference]: Start difference. First operand 2987 states and 6877 transitions. Second operand 7 states. [2018-12-09 17:32:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:09,806 INFO L93 Difference]: Finished difference Result 3491 states and 8023 transitions. [2018-12-09 17:32:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:32:09,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-12-09 17:32:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:09,809 INFO L225 Difference]: With dead ends: 3491 [2018-12-09 17:32:09,809 INFO L226 Difference]: Without dead ends: 3491 [2018-12-09 17:32:09,809 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-09 17:32:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2018-12-09 17:32:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3067. [2018-12-09 17:32:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2018-12-09 17:32:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 7024 transitions. [2018-12-09 17:32:09,830 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 7024 transitions. Word has length 85 [2018-12-09 17:32:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:09,830 INFO L480 AbstractCegarLoop]: Abstraction has 3067 states and 7024 transitions. [2018-12-09 17:32:09,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:32:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 7024 transitions. [2018-12-09 17:32:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:09,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:09,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:09,832 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:09,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1165377645, now seen corresponding path program 1 times [2018-12-09 17:32:09,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:09,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:09,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:09,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:09,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:32:09,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:09,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:32:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:32:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:32:09,931 INFO L87 Difference]: Start difference. First operand 3067 states and 7024 transitions. Second operand 10 states. [2018-12-09 17:32:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:10,608 INFO L93 Difference]: Finished difference Result 5534 states and 12773 transitions. [2018-12-09 17:32:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:32:10,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-09 17:32:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:10,610 INFO L225 Difference]: With dead ends: 5534 [2018-12-09 17:32:10,610 INFO L226 Difference]: Without dead ends: 3472 [2018-12-09 17:32:10,610 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-09 17:32:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2018-12-09 17:32:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3074. [2018-12-09 17:32:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2018-12-09 17:32:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 6933 transitions. [2018-12-09 17:32:10,631 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 6933 transitions. Word has length 85 [2018-12-09 17:32:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:10,631 INFO L480 AbstractCegarLoop]: Abstraction has 3074 states and 6933 transitions. [2018-12-09 17:32:10,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:32:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 6933 transitions. [2018-12-09 17:32:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:10,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:10,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:10,633 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:10,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1731855423, now seen corresponding path program 2 times [2018-12-09 17:32:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:10,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:32:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:10,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:10,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:32:10,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:10,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:32:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:32:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:32:10,707 INFO L87 Difference]: Start difference. First operand 3074 states and 6933 transitions. Second operand 10 states. [2018-12-09 17:32:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:11,047 INFO L93 Difference]: Finished difference Result 5496 states and 12510 transitions. [2018-12-09 17:32:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:32:11,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-09 17:32:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:11,048 INFO L225 Difference]: With dead ends: 5496 [2018-12-09 17:32:11,049 INFO L226 Difference]: Without dead ends: 2323 [2018-12-09 17:32:11,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:32:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2018-12-09 17:32:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2323. [2018-12-09 17:32:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2018-12-09 17:32:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 5311 transitions. [2018-12-09 17:32:11,062 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 5311 transitions. Word has length 85 [2018-12-09 17:32:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:11,062 INFO L480 AbstractCegarLoop]: Abstraction has 2323 states and 5311 transitions. [2018-12-09 17:32:11,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:32:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 5311 transitions. [2018-12-09 17:32:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:11,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:11,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:11,064 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:11,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash -105147112, now seen corresponding path program 2 times [2018-12-09 17:32:11,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:32:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:11,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:32:11,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:11,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:32:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:32:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:32:11,122 INFO L87 Difference]: Start difference. First operand 2323 states and 5311 transitions. Second operand 5 states. [2018-12-09 17:32:11,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:11,143 INFO L93 Difference]: Finished difference Result 2323 states and 5295 transitions. [2018-12-09 17:32:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:32:11,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-09 17:32:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:11,145 INFO L225 Difference]: With dead ends: 2323 [2018-12-09 17:32:11,145 INFO L226 Difference]: Without dead ends: 2323 [2018-12-09 17:32:11,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:32:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2018-12-09 17:32:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1858. [2018-12-09 17:32:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2018-12-09 17:32:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 4245 transitions. [2018-12-09 17:32:11,158 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 4245 transitions. Word has length 85 [2018-12-09 17:32:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 1858 states and 4245 transitions. [2018-12-09 17:32:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:32:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 4245 transitions. [2018-12-09 17:32:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:11,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:11,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:11,161 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:11,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash 782356569, now seen corresponding path program 3 times [2018-12-09 17:32:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:32:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:32:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:32:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:32:11,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 17:32:11,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:32:11,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 17:32:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 17:32:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:32:11,245 INFO L87 Difference]: Start difference. First operand 1858 states and 4245 transitions. Second operand 11 states. [2018-12-09 17:32:11,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:32:11,680 INFO L93 Difference]: Finished difference Result 3441 states and 7966 transitions. [2018-12-09 17:32:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:32:11,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-09 17:32:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:32:11,681 INFO L225 Difference]: With dead ends: 3441 [2018-12-09 17:32:11,681 INFO L226 Difference]: Without dead ends: 2032 [2018-12-09 17:32:11,681 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-09 17:32:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2018-12-09 17:32:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1838. [2018-12-09 17:32:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-12-09 17:32:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 4203 transitions. [2018-12-09 17:32:11,693 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 4203 transitions. Word has length 85 [2018-12-09 17:32:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:32:11,693 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 4203 transitions. [2018-12-09 17:32:11,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 17:32:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 4203 transitions. [2018-12-09 17:32:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 17:32:11,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:32:11,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:32:11,694 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:32:11,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:32:11,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-12-09 17:32:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:32:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 17:32:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:32:11,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:32:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:32:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 17:32:11,726 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 17:32:11,786 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 17:32:11,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:32:11 BasicIcfg [2018-12-09 17:32:11,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:32:11,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:32:11,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:32:11,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:32:11,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:31:57" (3/4) ... [2018-12-09 17:32:11,790 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 17:32:11,852 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f1b4112-6d63-426b-b033-8ca6369a1841/bin-2019/utaipan/witness.graphml [2018-12-09 17:32:11,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:32:11,853 INFO L168 Benchmark]: Toolchain (without parser) took 15359.22 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 950.6 MB in the beginning and 1.5 GB in the end (delta: -516.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,854 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:32:11,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,854 INFO L168 Benchmark]: Boogie Preprocessor took 22.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:32:11,854 INFO L168 Benchmark]: RCFGBuilder took 319.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,855 INFO L168 Benchmark]: TraceAbstraction took 14558.71 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -465.4 MB). Peak memory consumption was 969.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,855 INFO L168 Benchmark]: Witness Printer took 65.00 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:32:11,856 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -132.4 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 319.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14558.71 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -465.4 MB). Peak memory consumption was 969.5 MB. Max. memory is 11.5 GB. * Witness Printer took 65.00 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 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] [L684] -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, y=0] [L685] -1 _Bool y$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, y=0, y$flush_delayed=0] [L686] -1 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1659; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1659, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1660; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1660, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 14.4s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7751 SDtfs, 8810 SDslu, 18820 SDs, 0 SdLazy, 7864 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 73 SyntacticMatches, 21 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29288occurred in iteration=17, 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: 4.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 77452 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 375841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...