./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/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 47114b7025e0370460384816fc34be8953a40ffc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 11:46:59,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 11:46:59,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 11:46:59,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 11:46:59,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 11:46:59,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 11:46:59,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 11:46:59,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 11:46:59,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 11:46:59,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 11:46:59,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 11:46:59,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 11:46:59,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 11:46:59,864 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 11:46:59,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 11:46:59,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 11:46:59,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 11:46:59,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 11:46:59,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 11:46:59,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 11:46:59,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 11:46:59,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 11:46:59,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 11:46:59,870 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 11:46:59,870 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 11:46:59,871 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 11:46:59,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 11:46:59,872 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 11:46:59,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 11:46:59,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 11:46:59,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 11:46:59,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 11:46:59,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 11:46:59,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 11:46:59,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 11:46:59,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 11:46:59,874 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 11:46:59,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 11:46:59,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 11:46:59,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 11:46:59,882 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 11:46:59,882 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 11:46:59,883 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 11:46:59,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 11:46:59,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 11:46:59,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:46:59,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 11:46:59,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 11:46:59,885 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_18430ceb-c183-408c-a689-cb09efe78fa1/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 -> 47114b7025e0370460384816fc34be8953a40ffc [2018-12-02 11:46:59,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 11:46:59,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 11:46:59,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 11:46:59,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 11:46:59,912 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 11:46:59,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2018-12-02 11:46:59,946 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/data/878580814/680fffe30b884de5a6cde5efc26253a0/FLAGb087bab40 [2018-12-02 11:47:00,358 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 11:47:00,358 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/sv-benchmarks/c/pthread-wmm/safe029_power.opt_false-unreach-call.i [2018-12-02 11:47:00,366 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/data/878580814/680fffe30b884de5a6cde5efc26253a0/FLAGb087bab40 [2018-12-02 11:47:00,374 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/data/878580814/680fffe30b884de5a6cde5efc26253a0 [2018-12-02 11:47:00,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 11:47:00,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 11:47:00,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 11:47:00,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 11:47:00,380 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 11:47:00,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00, skipping insertion in model container [2018-12-02 11:47:00,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 11:47:00,415 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 11:47:00,635 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:47:00,644 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 11:47:00,726 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 11:47:00,757 INFO L195 MainTranslator]: Completed translation [2018-12-02 11:47:00,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00 WrapperNode [2018-12-02 11:47:00,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 11:47:00,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 11:47:00,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 11:47:00,758 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 11:47:00,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 11:47:00,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 11:47:00,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 11:47:00,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 11:47:00,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... [2018-12-02 11:47:00,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 11:47:00,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 11:47:00,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 11:47:00,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 11:47:00,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 11:47:00,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 11:47:00,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 11:47:00,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 11:47:00,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 11:47:00,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 11:47:00,845 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 11:47:01,150 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 11:47:01,151 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 11:47:01,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:01 BoogieIcfgContainer [2018-12-02 11:47:01,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 11:47:01,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 11:47:01,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 11:47:01,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 11:47:01,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:47:00" (1/3) ... [2018-12-02 11:47:01,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:47:01, skipping insertion in model container [2018-12-02 11:47:01,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:00" (2/3) ... [2018-12-02 11:47:01,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a58ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:47:01, skipping insertion in model container [2018-12-02 11:47:01,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:01" (3/3) ... [2018-12-02 11:47:01,155 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_false-unreach-call.i [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,176 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,177 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,178 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,179 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,180 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,181 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,182 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,183 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,184 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,185 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 11:47:01,195 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 11:47:01,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 11:47:01,200 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 11:47:01,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 11:47:01,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 11:47:01,223 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 11:47:01,223 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 11:47:01,223 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 11:47:01,223 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 11:47:01,224 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 11:47:01,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 11:47:01,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 11:47:01,230 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140places, 178 transitions [2018-12-02 11:47:02,219 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25086 states. [2018-12-02 11:47:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states. [2018-12-02 11:47:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 11:47:02,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:02,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:02,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:02,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1594278667, now seen corresponding path program 1 times [2018-12-02 11:47:02,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:02,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:02,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:02,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:02,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:02,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:02,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:47:02,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:02,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:47:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:47:02,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:02,385 INFO L87 Difference]: Start difference. First operand 25086 states. Second operand 4 states. [2018-12-02 11:47:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:02,754 INFO L93 Difference]: Finished difference Result 45386 states and 177624 transitions. [2018-12-02 11:47:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:47:02,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 11:47:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:02,936 INFO L225 Difference]: With dead ends: 45386 [2018-12-02 11:47:02,936 INFO L226 Difference]: Without dead ends: 40626 [2018-12-02 11:47:02,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40626 states. [2018-12-02 11:47:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40626 to 23660. [2018-12-02 11:47:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23660 states. [2018-12-02 11:47:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23660 states to 23660 states and 92541 transitions. [2018-12-02 11:47:03,616 INFO L78 Accepts]: Start accepts. Automaton has 23660 states and 92541 transitions. Word has length 35 [2018-12-02 11:47:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:03,617 INFO L480 AbstractCegarLoop]: Abstraction has 23660 states and 92541 transitions. [2018-12-02 11:47:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:47:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 23660 states and 92541 transitions. [2018-12-02 11:47:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 11:47:03,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:03,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:03,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:03,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1049069648, now seen corresponding path program 1 times [2018-12-02 11:47:03,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:03,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:03,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:03,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:03,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:03,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:03,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:03,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:03,678 INFO L87 Difference]: Start difference. First operand 23660 states and 92541 transitions. Second operand 5 states. [2018-12-02 11:47:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:04,274 INFO L93 Difference]: Finished difference Result 64828 states and 241367 transitions. [2018-12-02 11:47:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:47:04,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-12-02 11:47:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:04,432 INFO L225 Difference]: With dead ends: 64828 [2018-12-02 11:47:04,433 INFO L226 Difference]: Without dead ends: 64668 [2018-12-02 11:47:04,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:47:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64668 states. [2018-12-02 11:47:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64668 to 37140. [2018-12-02 11:47:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37140 states. [2018-12-02 11:47:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37140 states to 37140 states and 138282 transitions. [2018-12-02 11:47:05,220 INFO L78 Accepts]: Start accepts. Automaton has 37140 states and 138282 transitions. Word has length 42 [2018-12-02 11:47:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:05,221 INFO L480 AbstractCegarLoop]: Abstraction has 37140 states and 138282 transitions. [2018-12-02 11:47:05,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 37140 states and 138282 transitions. [2018-12-02 11:47:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 11:47:05,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:05,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] [2018-12-02 11:47:05,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:05,226 INFO L82 PathProgramCache]: Analyzing trace with hash -888651829, now seen corresponding path program 1 times [2018-12-02 11:47:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:05,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:05,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:47:05,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:05,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:47:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:47:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:05,277 INFO L87 Difference]: Start difference. First operand 37140 states and 138282 transitions. Second operand 4 states. [2018-12-02 11:47:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:05,329 INFO L93 Difference]: Finished difference Result 12362 states and 41175 transitions. [2018-12-02 11:47:05,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:47:05,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-02 11:47:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:05,345 INFO L225 Difference]: With dead ends: 12362 [2018-12-02 11:47:05,345 INFO L226 Difference]: Without dead ends: 11841 [2018-12-02 11:47:05,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2018-12-02 11:47:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11841. [2018-12-02 11:47:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11841 states. [2018-12-02 11:47:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11841 states to 11841 states and 39620 transitions. [2018-12-02 11:47:05,480 INFO L78 Accepts]: Start accepts. Automaton has 11841 states and 39620 transitions. Word has length 43 [2018-12-02 11:47:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:05,480 INFO L480 AbstractCegarLoop]: Abstraction has 11841 states and 39620 transitions. [2018-12-02 11:47:05,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:47:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 11841 states and 39620 transitions. [2018-12-02 11:47:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 11:47:05,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:05,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:05,483 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:05,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1845292501, now seen corresponding path program 1 times [2018-12-02 11:47:05,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:05,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:05,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:05,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:47:05,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:05,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:47:05,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:47:05,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:05,536 INFO L87 Difference]: Start difference. First operand 11841 states and 39620 transitions. Second operand 4 states. [2018-12-02 11:47:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:05,711 INFO L93 Difference]: Finished difference Result 17017 states and 55691 transitions. [2018-12-02 11:47:05,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:47:05,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 11:47:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:05,733 INFO L225 Difference]: With dead ends: 17017 [2018-12-02 11:47:05,734 INFO L226 Difference]: Without dead ends: 17017 [2018-12-02 11:47:05,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17017 states. [2018-12-02 11:47:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17017 to 12877. [2018-12-02 11:47:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12877 states. [2018-12-02 11:47:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12877 states to 12877 states and 42718 transitions. [2018-12-02 11:47:05,933 INFO L78 Accepts]: Start accepts. Automaton has 12877 states and 42718 transitions. Word has length 56 [2018-12-02 11:47:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:05,933 INFO L480 AbstractCegarLoop]: Abstraction has 12877 states and 42718 transitions. [2018-12-02 11:47:05,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:47:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 12877 states and 42718 transitions. [2018-12-02 11:47:05,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 11:47:05,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:05,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:05,938 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:05,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:05,938 INFO L82 PathProgramCache]: Analyzing trace with hash -169488919, now seen corresponding path program 1 times [2018-12-02 11:47:05,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:05,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:05,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:05,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:05,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:05,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:05,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:05,992 INFO L87 Difference]: Start difference. First operand 12877 states and 42718 transitions. Second operand 6 states. [2018-12-02 11:47:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:06,384 INFO L93 Difference]: Finished difference Result 18597 states and 60828 transitions. [2018-12-02 11:47:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 11:47:06,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-02 11:47:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:06,406 INFO L225 Difference]: With dead ends: 18597 [2018-12-02 11:47:06,406 INFO L226 Difference]: Without dead ends: 18565 [2018-12-02 11:47:06,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 11:47:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18565 states. [2018-12-02 11:47:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18565 to 14409. [2018-12-02 11:47:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14409 states. [2018-12-02 11:47:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14409 states to 14409 states and 47547 transitions. [2018-12-02 11:47:06,588 INFO L78 Accepts]: Start accepts. Automaton has 14409 states and 47547 transitions. Word has length 56 [2018-12-02 11:47:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:06,589 INFO L480 AbstractCegarLoop]: Abstraction has 14409 states and 47547 transitions. [2018-12-02 11:47:06,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14409 states and 47547 transitions. [2018-12-02 11:47:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 11:47:06,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:06,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:06,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:06,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash 860313174, now seen corresponding path program 1 times [2018-12-02 11:47:06,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:06,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:06,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:06,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:06,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:06,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:06,693 INFO L87 Difference]: Start difference. First operand 14409 states and 47547 transitions. Second operand 7 states. [2018-12-02 11:47:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:08,481 INFO L93 Difference]: Finished difference Result 49866 states and 161886 transitions. [2018-12-02 11:47:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 11:47:08,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-02 11:47:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:08,552 INFO L225 Difference]: With dead ends: 49866 [2018-12-02 11:47:08,552 INFO L226 Difference]: Without dead ends: 49594 [2018-12-02 11:47:08,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:47:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49594 states. [2018-12-02 11:47:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49594 to 22262. [2018-12-02 11:47:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22262 states. [2018-12-02 11:47:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22262 states to 22262 states and 72740 transitions. [2018-12-02 11:47:09,028 INFO L78 Accepts]: Start accepts. Automaton has 22262 states and 72740 transitions. Word has length 70 [2018-12-02 11:47:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:09,028 INFO L480 AbstractCegarLoop]: Abstraction has 22262 states and 72740 transitions. [2018-12-02 11:47:09,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22262 states and 72740 transitions. [2018-12-02 11:47:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 11:47:09,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:09,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:09,043 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:09,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2081344425, now seen corresponding path program 1 times [2018-12-02 11:47:09,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:09,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:09,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:09,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:09,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:09,107 INFO L87 Difference]: Start difference. First operand 22262 states and 72740 transitions. Second operand 5 states. [2018-12-02 11:47:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:09,142 INFO L93 Difference]: Finished difference Result 4734 states and 12518 transitions. [2018-12-02 11:47:09,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:47:09,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 11:47:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:09,145 INFO L225 Difference]: With dead ends: 4734 [2018-12-02 11:47:09,145 INFO L226 Difference]: Without dead ends: 3910 [2018-12-02 11:47:09,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2018-12-02 11:47:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3410. [2018-12-02 11:47:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2018-12-02 11:47:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9066 transitions. [2018-12-02 11:47:09,172 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9066 transitions. Word has length 70 [2018-12-02 11:47:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 3410 states and 9066 transitions. [2018-12-02 11:47:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9066 transitions. [2018-12-02 11:47:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 11:47:09,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:09,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:09,176 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:09,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash 583358504, now seen corresponding path program 1 times [2018-12-02 11:47:09,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:09,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:09,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 11:47:09,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:09,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 11:47:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 11:47:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:47:09,214 INFO L87 Difference]: Start difference. First operand 3410 states and 9066 transitions. Second operand 3 states. [2018-12-02 11:47:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:09,302 INFO L93 Difference]: Finished difference Result 3508 states and 9283 transitions. [2018-12-02 11:47:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 11:47:09,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2018-12-02 11:47:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:09,305 INFO L225 Difference]: With dead ends: 3508 [2018-12-02 11:47:09,305 INFO L226 Difference]: Without dead ends: 3508 [2018-12-02 11:47:09,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 11:47:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2018-12-02 11:47:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3448. [2018-12-02 11:47:09,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3448 states. [2018-12-02 11:47:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3448 states to 3448 states and 9152 transitions. [2018-12-02 11:47:09,331 INFO L78 Accepts]: Start accepts. Automaton has 3448 states and 9152 transitions. Word has length 89 [2018-12-02 11:47:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:09,331 INFO L480 AbstractCegarLoop]: Abstraction has 3448 states and 9152 transitions. [2018-12-02 11:47:09,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 11:47:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3448 states and 9152 transitions. [2018-12-02 11:47:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 11:47:09,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:09,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:09,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:09,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash -549832089, now seen corresponding path program 1 times [2018-12-02 11:47:09,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:09,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:47:09,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:47:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:47:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:09,360 INFO L87 Difference]: Start difference. First operand 3448 states and 9152 transitions. Second operand 4 states. [2018-12-02 11:47:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:09,493 INFO L93 Difference]: Finished difference Result 4895 states and 13030 transitions. [2018-12-02 11:47:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:47:09,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-12-02 11:47:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:09,498 INFO L225 Difference]: With dead ends: 4895 [2018-12-02 11:47:09,498 INFO L226 Difference]: Without dead ends: 4895 [2018-12-02 11:47:09,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-12-02 11:47:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 3488. [2018-12-02 11:47:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2018-12-02 11:47:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 9242 transitions. [2018-12-02 11:47:09,530 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 9242 transitions. Word has length 89 [2018-12-02 11:47:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:09,530 INFO L480 AbstractCegarLoop]: Abstraction has 3488 states and 9242 transitions. [2018-12-02 11:47:09,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:47:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 9242 transitions. [2018-12-02 11:47:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 11:47:09,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:09,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:09,533 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:09,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1688964463, now seen corresponding path program 2 times [2018-12-02 11:47:09,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:09,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:09,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:09,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:09,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:09,569 INFO L87 Difference]: Start difference. First operand 3488 states and 9242 transitions. Second operand 5 states. [2018-12-02 11:47:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:09,713 INFO L93 Difference]: Finished difference Result 4960 states and 12809 transitions. [2018-12-02 11:47:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 11:47:09,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 11:47:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:09,717 INFO L225 Difference]: With dead ends: 4960 [2018-12-02 11:47:09,717 INFO L226 Difference]: Without dead ends: 4960 [2018-12-02 11:47:09,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2018-12-02 11:47:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4173. [2018-12-02 11:47:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4173 states. [2018-12-02 11:47:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 10939 transitions. [2018-12-02 11:47:09,747 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 10939 transitions. Word has length 89 [2018-12-02 11:47:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:09,747 INFO L480 AbstractCegarLoop]: Abstraction has 4173 states and 10939 transitions. [2018-12-02 11:47:09,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 10939 transitions. [2018-12-02 11:47:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 11:47:09,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:09,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:09,750 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:09,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1929956275, now seen corresponding path program 3 times [2018-12-02 11:47:09,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:09,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:47:09,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:09,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:09,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:09,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:09,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:09,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:09,799 INFO L87 Difference]: Start difference. First operand 4173 states and 10939 transitions. Second operand 7 states. [2018-12-02 11:47:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:10,025 INFO L93 Difference]: Finished difference Result 5187 states and 13337 transitions. [2018-12-02 11:47:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:47:10,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-12-02 11:47:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:10,028 INFO L225 Difference]: With dead ends: 5187 [2018-12-02 11:47:10,029 INFO L226 Difference]: Without dead ends: 5108 [2018-12-02 11:47:10,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:47:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2018-12-02 11:47:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4355. [2018-12-02 11:47:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-12-02 11:47:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 11357 transitions. [2018-12-02 11:47:10,060 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 11357 transitions. Word has length 89 [2018-12-02 11:47:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:10,060 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 11357 transitions. [2018-12-02 11:47:10,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 11357 transitions. [2018-12-02 11:47:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 11:47:10,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:10,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, 1, 1, 1, 1] [2018-12-02 11:47:10,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:10,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 40983182, now seen corresponding path program 1 times [2018-12-02 11:47:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:47:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:10,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:10,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:10,121 INFO L87 Difference]: Start difference. First operand 4355 states and 11357 transitions. Second operand 5 states. [2018-12-02 11:47:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:10,238 INFO L93 Difference]: Finished difference Result 5801 states and 14770 transitions. [2018-12-02 11:47:10,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:47:10,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2018-12-02 11:47:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:10,242 INFO L225 Difference]: With dead ends: 5801 [2018-12-02 11:47:10,242 INFO L226 Difference]: Without dead ends: 5737 [2018-12-02 11:47:10,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:47:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2018-12-02 11:47:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 4437. [2018-12-02 11:47:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4437 states. [2018-12-02 11:47:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4437 states to 4437 states and 11528 transitions. [2018-12-02 11:47:10,277 INFO L78 Accepts]: Start accepts. Automaton has 4437 states and 11528 transitions. Word has length 89 [2018-12-02 11:47:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:10,277 INFO L480 AbstractCegarLoop]: Abstraction has 4437 states and 11528 transitions. [2018-12-02 11:47:10,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4437 states and 11528 transitions. [2018-12-02 11:47:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:10,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:10,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:10,281 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:10,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1540346686, now seen corresponding path program 1 times [2018-12-02 11:47:10,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:10,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:10,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 11:47:10,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:10,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 11:47:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 11:47:10,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:10,310 INFO L87 Difference]: Start difference. First operand 4437 states and 11528 transitions. Second operand 4 states. [2018-12-02 11:47:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:10,401 INFO L93 Difference]: Finished difference Result 7785 states and 20394 transitions. [2018-12-02 11:47:10,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:47:10,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 11:47:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:10,407 INFO L225 Difference]: With dead ends: 7785 [2018-12-02 11:47:10,407 INFO L226 Difference]: Without dead ends: 7757 [2018-12-02 11:47:10,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 11:47:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2018-12-02 11:47:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 4179. [2018-12-02 11:47:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4179 states. [2018-12-02 11:47:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4179 states to 4179 states and 10785 transitions. [2018-12-02 11:47:10,447 INFO L78 Accepts]: Start accepts. Automaton has 4179 states and 10785 transitions. Word has length 91 [2018-12-02 11:47:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:10,448 INFO L480 AbstractCegarLoop]: Abstraction has 4179 states and 10785 transitions. [2018-12-02 11:47:10,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 11:47:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4179 states and 10785 transitions. [2018-12-02 11:47:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:10,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:10,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:10,451 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:10,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash -162033363, now seen corresponding path program 1 times [2018-12-02 11:47:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:10,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:10,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:10,512 INFO L87 Difference]: Start difference. First operand 4179 states and 10785 transitions. Second operand 6 states. [2018-12-02 11:47:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:10,687 INFO L93 Difference]: Finished difference Result 4586 states and 11717 transitions. [2018-12-02 11:47:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:47:10,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 11:47:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:10,691 INFO L225 Difference]: With dead ends: 4586 [2018-12-02 11:47:10,691 INFO L226 Difference]: Without dead ends: 4586 [2018-12-02 11:47:10,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2018-12-02 11:47:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4232. [2018-12-02 11:47:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2018-12-02 11:47:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 10914 transitions. [2018-12-02 11:47:10,732 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 10914 transitions. Word has length 91 [2018-12-02 11:47:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:10,732 INFO L480 AbstractCegarLoop]: Abstraction has 4232 states and 10914 transitions. [2018-12-02 11:47:10,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 10914 transitions. [2018-12-02 11:47:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:10,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:10,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:10,736 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:10,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:10,736 INFO L82 PathProgramCache]: Analyzing trace with hash 807547660, now seen corresponding path program 1 times [2018-12-02 11:47:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:10,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:10,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:10,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:10,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:10,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:10,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:10,803 INFO L87 Difference]: Start difference. First operand 4232 states and 10914 transitions. Second operand 6 states. [2018-12-02 11:47:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:10,944 INFO L93 Difference]: Finished difference Result 6106 states and 15541 transitions. [2018-12-02 11:47:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:47:10,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 11:47:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:10,949 INFO L225 Difference]: With dead ends: 6106 [2018-12-02 11:47:10,949 INFO L226 Difference]: Without dead ends: 6074 [2018-12-02 11:47:10,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2018-12-02 11:47:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 4851. [2018-12-02 11:47:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2018-12-02 11:47:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 12449 transitions. [2018-12-02 11:47:10,993 INFO L78 Accepts]: Start accepts. Automaton has 4851 states and 12449 transitions. Word has length 91 [2018-12-02 11:47:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:10,994 INFO L480 AbstractCegarLoop]: Abstraction has 4851 states and 12449 transitions. [2018-12-02 11:47:10,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 4851 states and 12449 transitions. [2018-12-02 11:47:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:10,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:10,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:10,999 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:10,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1769161677, now seen corresponding path program 1 times [2018-12-02 11:47:10,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:11,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:11,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:11,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:11,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:11,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:11,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:11,060 INFO L87 Difference]: Start difference. First operand 4851 states and 12449 transitions. Second operand 7 states. [2018-12-02 11:47:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:11,346 INFO L93 Difference]: Finished difference Result 9774 states and 25388 transitions. [2018-12-02 11:47:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 11:47:11,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 11:47:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:11,354 INFO L225 Difference]: With dead ends: 9774 [2018-12-02 11:47:11,354 INFO L226 Difference]: Without dead ends: 9774 [2018-12-02 11:47:11,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-02 11:47:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2018-12-02 11:47:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 5475. [2018-12-02 11:47:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5475 states. [2018-12-02 11:47:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 14083 transitions. [2018-12-02 11:47:11,448 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 14083 transitions. Word has length 91 [2018-12-02 11:47:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:11,448 INFO L480 AbstractCegarLoop]: Abstraction has 5475 states and 14083 transitions. [2018-12-02 11:47:11,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 14083 transitions. [2018-12-02 11:47:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:11,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:11,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:11,452 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:11,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1281041138, now seen corresponding path program 1 times [2018-12-02 11:47:11,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:11,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:11,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:11,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:11,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:11,536 INFO L87 Difference]: Start difference. First operand 5475 states and 14083 transitions. Second operand 7 states. [2018-12-02 11:47:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:11,729 INFO L93 Difference]: Finished difference Result 5137 states and 13135 transitions. [2018-12-02 11:47:11,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:47:11,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 11:47:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:11,733 INFO L225 Difference]: With dead ends: 5137 [2018-12-02 11:47:11,733 INFO L226 Difference]: Without dead ends: 5137 [2018-12-02 11:47:11,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 11:47:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2018-12-02 11:47:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 4996. [2018-12-02 11:47:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2018-12-02 11:47:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 12823 transitions. [2018-12-02 11:47:11,768 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 12823 transitions. Word has length 91 [2018-12-02 11:47:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:11,768 INFO L480 AbstractCegarLoop]: Abstraction has 4996 states and 12823 transitions. [2018-12-02 11:47:11,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 12823 transitions. [2018-12-02 11:47:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:11,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:11,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:11,772 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:11,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1672445698, now seen corresponding path program 1 times [2018-12-02 11:47:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:11,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:11,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:11,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:11,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:11,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:11,842 INFO L87 Difference]: Start difference. First operand 4996 states and 12823 transitions. Second operand 7 states. [2018-12-02 11:47:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:11,975 INFO L93 Difference]: Finished difference Result 5446 states and 13900 transitions. [2018-12-02 11:47:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:47:11,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 11:47:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:11,980 INFO L225 Difference]: With dead ends: 5446 [2018-12-02 11:47:11,980 INFO L226 Difference]: Without dead ends: 5446 [2018-12-02 11:47:11,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2018-12-02 11:47:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 5036. [2018-12-02 11:47:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2018-12-02 11:47:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 12894 transitions. [2018-12-02 11:47:12,021 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 12894 transitions. Word has length 91 [2018-12-02 11:47:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:12,021 INFO L480 AbstractCegarLoop]: Abstraction has 5036 states and 12894 transitions. [2018-12-02 11:47:12,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 12894 transitions. [2018-12-02 11:47:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:12,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:12,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:12,028 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:12,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1439174301, now seen corresponding path program 1 times [2018-12-02 11:47:12,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:12,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:12,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:12,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:12,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:12,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:12,094 INFO L87 Difference]: Start difference. First operand 5036 states and 12894 transitions. Second operand 5 states. [2018-12-02 11:47:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:12,154 INFO L93 Difference]: Finished difference Result 4529 states and 11631 transitions. [2018-12-02 11:47:12,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 11:47:12,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 11:47:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:12,157 INFO L225 Difference]: With dead ends: 4529 [2018-12-02 11:47:12,157 INFO L226 Difference]: Without dead ends: 4529 [2018-12-02 11:47:12,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2018-12-02 11:47:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4491. [2018-12-02 11:47:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4491 states. [2018-12-02 11:47:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 11554 transitions. [2018-12-02 11:47:12,186 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 11554 transitions. Word has length 91 [2018-12-02 11:47:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:12,186 INFO L480 AbstractCegarLoop]: Abstraction has 4491 states and 11554 transitions. [2018-12-02 11:47:12,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 11554 transitions. [2018-12-02 11:47:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 11:47:12,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:12,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:12,189 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:12,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash -347029090, now seen corresponding path program 1 times [2018-12-02 11:47:12,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:12,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:12,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:12,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:12,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:12,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:12,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:12,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:12,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:12,250 INFO L87 Difference]: Start difference. First operand 4491 states and 11554 transitions. Second operand 6 states. [2018-12-02 11:47:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:12,297 INFO L93 Difference]: Finished difference Result 4075 states and 10146 transitions. [2018-12-02 11:47:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 11:47:12,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 11:47:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:12,300 INFO L225 Difference]: With dead ends: 4075 [2018-12-02 11:47:12,300 INFO L226 Difference]: Without dead ends: 4075 [2018-12-02 11:47:12,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2018-12-02 11:47:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2421. [2018-12-02 11:47:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2018-12-02 11:47:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 6211 transitions. [2018-12-02 11:47:12,320 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 6211 transitions. Word has length 91 [2018-12-02 11:47:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:12,320 INFO L480 AbstractCegarLoop]: Abstraction has 2421 states and 6211 transitions. [2018-12-02 11:47:12,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 6211 transitions. [2018-12-02 11:47:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:12,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:12,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:12,322 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:12,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash -626984130, now seen corresponding path program 1 times [2018-12-02 11:47:12,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:12,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:12,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:12,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:12,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:12,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:12,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:12,361 INFO L87 Difference]: Start difference. First operand 2421 states and 6211 transitions. Second operand 7 states. [2018-12-02 11:47:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:12,618 INFO L93 Difference]: Finished difference Result 3893 states and 9716 transitions. [2018-12-02 11:47:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 11:47:12,618 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 11:47:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:12,621 INFO L225 Difference]: With dead ends: 3893 [2018-12-02 11:47:12,621 INFO L226 Difference]: Without dead ends: 3861 [2018-12-02 11:47:12,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 11:47:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2018-12-02 11:47:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3073. [2018-12-02 11:47:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-12-02 11:47:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 7791 transitions. [2018-12-02 11:47:12,647 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 7791 transitions. Word has length 93 [2018-12-02 11:47:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:12,648 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 7791 transitions. [2018-12-02 11:47:12,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 7791 transitions. [2018-12-02 11:47:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:12,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:12,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:12,650 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:12,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 617780351, now seen corresponding path program 1 times [2018-12-02 11:47:12,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:12,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:12,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:12,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:12,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:12,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:12,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:12,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:12,706 INFO L87 Difference]: Start difference. First operand 3073 states and 7791 transitions. Second operand 6 states. [2018-12-02 11:47:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:12,782 INFO L93 Difference]: Finished difference Result 3123 states and 7833 transitions. [2018-12-02 11:47:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 11:47:12,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 11:47:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:12,785 INFO L225 Difference]: With dead ends: 3123 [2018-12-02 11:47:12,785 INFO L226 Difference]: Without dead ends: 3123 [2018-12-02 11:47:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 11:47:12,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2018-12-02 11:47:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3043. [2018-12-02 11:47:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2018-12-02 11:47:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 7679 transitions. [2018-12-02 11:47:12,807 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 7679 transitions. Word has length 93 [2018-12-02 11:47:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:12,807 INFO L480 AbstractCegarLoop]: Abstraction has 3043 states and 7679 transitions. [2018-12-02 11:47:12,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 7679 transitions. [2018-12-02 11:47:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:12,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:12,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:12,810 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:12,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -297218369, now seen corresponding path program 1 times [2018-12-02 11:47:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:12,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:12,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:12,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:12,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:12,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:12,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:12,864 INFO L87 Difference]: Start difference. First operand 3043 states and 7679 transitions. Second operand 6 states. [2018-12-02 11:47:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:13,017 INFO L93 Difference]: Finished difference Result 3582 states and 8908 transitions. [2018-12-02 11:47:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:47:13,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 11:47:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:13,021 INFO L225 Difference]: With dead ends: 3582 [2018-12-02 11:47:13,021 INFO L226 Difference]: Without dead ends: 3582 [2018-12-02 11:47:13,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 11:47:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2018-12-02 11:47:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 3082. [2018-12-02 11:47:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-02 11:47:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7728 transitions. [2018-12-02 11:47:13,050 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7728 transitions. Word has length 93 [2018-12-02 11:47:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:13,050 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7728 transitions. [2018-12-02 11:47:13,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7728 transitions. [2018-12-02 11:47:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:13,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:13,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:13,053 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:13,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1093073861, now seen corresponding path program 2 times [2018-12-02 11:47:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:13,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:13,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:13,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:13,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:13,114 INFO L87 Difference]: Start difference. First operand 3082 states and 7728 transitions. Second operand 7 states. [2018-12-02 11:47:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:13,302 INFO L93 Difference]: Finished difference Result 3099 states and 7760 transitions. [2018-12-02 11:47:13,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 11:47:13,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 11:47:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:13,304 INFO L225 Difference]: With dead ends: 3099 [2018-12-02 11:47:13,304 INFO L226 Difference]: Without dead ends: 3099 [2018-12-02 11:47:13,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-02 11:47:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2018-12-02 11:47:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3082. [2018-12-02 11:47:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2018-12-02 11:47:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 7725 transitions. [2018-12-02 11:47:13,327 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 7725 transitions. Word has length 93 [2018-12-02 11:47:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:13,327 INFO L480 AbstractCegarLoop]: Abstraction has 3082 states and 7725 transitions. [2018-12-02 11:47:13,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 7725 transitions. [2018-12-02 11:47:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:13,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:13,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:13,330 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:13,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:13,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1409070332, now seen corresponding path program 1 times [2018-12-02 11:47:13,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:47:13,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:13,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:13,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:13,378 INFO L87 Difference]: Start difference. First operand 3082 states and 7725 transitions. Second operand 7 states. [2018-12-02 11:47:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:13,561 INFO L93 Difference]: Finished difference Result 4056 states and 10447 transitions. [2018-12-02 11:47:13,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 11:47:13,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 11:47:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:13,564 INFO L225 Difference]: With dead ends: 4056 [2018-12-02 11:47:13,564 INFO L226 Difference]: Without dead ends: 4056 [2018-12-02 11:47:13,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-02 11:47:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2018-12-02 11:47:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2458. [2018-12-02 11:47:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2018-12-02 11:47:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 6206 transitions. [2018-12-02 11:47:13,586 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 6206 transitions. Word has length 93 [2018-12-02 11:47:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:13,586 INFO L480 AbstractCegarLoop]: Abstraction has 2458 states and 6206 transitions. [2018-12-02 11:47:13,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 6206 transitions. [2018-12-02 11:47:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:13,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:13,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:13,588 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:13,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash 494071612, now seen corresponding path program 1 times [2018-12-02 11:47:13,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 11:47:13,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:13,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 11:47:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 11:47:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 11:47:13,626 INFO L87 Difference]: Start difference. First operand 2458 states and 6206 transitions. Second operand 5 states. [2018-12-02 11:47:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:13,727 INFO L93 Difference]: Finished difference Result 2810 states and 7070 transitions. [2018-12-02 11:47:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:47:13,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-02 11:47:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:13,729 INFO L225 Difference]: With dead ends: 2810 [2018-12-02 11:47:13,730 INFO L226 Difference]: Without dead ends: 2778 [2018-12-02 11:47:13,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2018-12-02 11:47:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2506. [2018-12-02 11:47:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2018-12-02 11:47:13,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6310 transitions. [2018-12-02 11:47:13,750 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6310 transitions. Word has length 93 [2018-12-02 11:47:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:13,750 INFO L480 AbstractCegarLoop]: Abstraction has 2506 states and 6310 transitions. [2018-12-02 11:47:13,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 11:47:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6310 transitions. [2018-12-02 11:47:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:13,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:13,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:13,753 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:13,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1738836093, now seen corresponding path program 1 times [2018-12-02 11:47:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:13,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:13,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:13,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 11:47:13,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:13,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 11:47:13,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 11:47:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:13,808 INFO L87 Difference]: Start difference. First operand 2506 states and 6310 transitions. Second operand 7 states. [2018-12-02 11:47:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:13,961 INFO L93 Difference]: Finished difference Result 4157 states and 10693 transitions. [2018-12-02 11:47:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 11:47:13,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 11:47:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:13,963 INFO L225 Difference]: With dead ends: 4157 [2018-12-02 11:47:13,963 INFO L226 Difference]: Without dead ends: 1726 [2018-12-02 11:47:13,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 11:47:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-12-02 11:47:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2018-12-02 11:47:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-12-02 11:47:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4513 transitions. [2018-12-02 11:47:13,975 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4513 transitions. Word has length 93 [2018-12-02 11:47:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:13,975 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 4513 transitions. [2018-12-02 11:47:13,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 11:47:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4513 transitions. [2018-12-02 11:47:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:13,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:13,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:13,976 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:13,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:13,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1752144950, now seen corresponding path program 1 times [2018-12-02 11:47:13,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:13,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:14,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:14,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 11:47:14,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:14,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 11:47:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 11:47:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 11:47:14,040 INFO L87 Difference]: Start difference. First operand 1726 states and 4513 transitions. Second operand 6 states. [2018-12-02 11:47:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:14,113 INFO L93 Difference]: Finished difference Result 1812 states and 4666 transitions. [2018-12-02 11:47:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 11:47:14,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 11:47:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:14,115 INFO L225 Difference]: With dead ends: 1812 [2018-12-02 11:47:14,115 INFO L226 Difference]: Without dead ends: 1792 [2018-12-02 11:47:14,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 11:47:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-12-02 11:47:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1718. [2018-12-02 11:47:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-12-02 11:47:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 4487 transitions. [2018-12-02 11:47:14,132 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 4487 transitions. Word has length 93 [2018-12-02 11:47:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:14,132 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 4487 transitions. [2018-12-02 11:47:14,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 11:47:14,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 4487 transitions. [2018-12-02 11:47:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:14,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:14,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:14,142 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:14,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:14,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2094125707, now seen corresponding path program 2 times [2018-12-02 11:47:14,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:14,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 11:47:14,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:14,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 11:47:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 11:47:14,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 11:47:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 11:47:14,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 11:47:14,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 11:47:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 11:47:14,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 11:47:14,241 INFO L87 Difference]: Start difference. First operand 1718 states and 4487 transitions. Second operand 12 states. [2018-12-02 11:47:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 11:47:14,582 INFO L93 Difference]: Finished difference Result 3315 states and 8720 transitions. [2018-12-02 11:47:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 11:47:14,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-12-02 11:47:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 11:47:14,583 INFO L225 Difference]: With dead ends: 3315 [2018-12-02 11:47:14,584 INFO L226 Difference]: Without dead ends: 2339 [2018-12-02 11:47:14,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 11:47:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2018-12-02 11:47:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2187. [2018-12-02 11:47:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2187 states. [2018-12-02 11:47:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 5546 transitions. [2018-12-02 11:47:14,599 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 5546 transitions. Word has length 93 [2018-12-02 11:47:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 11:47:14,599 INFO L480 AbstractCegarLoop]: Abstraction has 2187 states and 5546 transitions. [2018-12-02 11:47:14,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 11:47:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 5546 transitions. [2018-12-02 11:47:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 11:47:14,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 11:47:14,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 11:47:14,600 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 11:47:14,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 11:47:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1369725745, now seen corresponding path program 3 times [2018-12-02 11:47:14,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 11:47:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:14,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 11:47:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 11:47:14,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 11:47:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:47:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 11:47:14,646 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 11:47:14,726 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 11:47:14,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:47:14 BasicIcfg [2018-12-02 11:47:14,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 11:47:14,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 11:47:14,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 11:47:14,728 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 11:47:14,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:01" (3/4) ... [2018-12-02 11:47:14,731 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 11:47:14,812 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_18430ceb-c183-408c-a689-cb09efe78fa1/bin-2019/utaipan/witness.graphml [2018-12-02 11:47:14,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 11:47:14,813 INFO L168 Benchmark]: Toolchain (without parser) took 14436.34 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 953.5 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 483.5 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,814 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:47:14,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,814 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 11:47:14,815 INFO L168 Benchmark]: RCFGBuilder took 339.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,815 INFO L168 Benchmark]: TraceAbstraction took 13576.23 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -973.0 MB). Peak memory consumption was 418.0 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,815 INFO L168 Benchmark]: Witness Printer took 83.99 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-02 11:47:14,817 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 339.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13576.23 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -973.0 MB). Peak memory consumption was 418.0 MB. Max. memory is 11.5 GB. * Witness Printer took 83.99 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L672] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L673] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L675] -1 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L676] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L677] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L678] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L679] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L680] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L681] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L682] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L683] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L684] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L685] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L686] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L687] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L688] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L689] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L691] -1 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L692] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L693] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] -1 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] FCALL, FORK -1 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] -1 pthread_t t2478; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] FCALL, FORK -1 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 x$w_buff1 = x$w_buff0 [L718] 0 x$w_buff0 = 2 [L719] 0 x$w_buff1_used = x$w_buff0_used [L720] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L723] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L724] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L725] 0 x$r_buff0_thd2 = (_Bool)1 [L728] 0 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L697] 1 y = 2 [L700] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L703] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L703] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L704] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L704] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L705] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L705] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L706] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L706] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L735] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L738] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L707] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L710] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L763] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L764] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L765] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L766] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L769] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L770] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L771] -1 x$flush_delayed = weak$$choice2 [L772] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L774] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L775] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L776] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L778] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L779] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] -1 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 x = x$flush_delayed ? x$mem_tmp : x [L782] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 178 locations, 3 error locations. UNSAFE Result, 13.5s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6365 SDtfs, 6376 SDslu, 13421 SDs, 0 SdLazy, 6052 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 91 SyntacticMatches, 13 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37140occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 100107 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2475 NumberOfCodeBlocks, 2475 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2353 ConstructedInterpolants, 0 QuantifiedInterpolants, 491429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...