./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_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_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/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 7540c95af84ce36a44a847aa5fc0422896a0f0bd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:48:13,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:48:13,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:48:13,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:48:13,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:48:13,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:48:13,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:48:13,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:48:13,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:48:13,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:48:13,083 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:48:13,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:48:13,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:48:13,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:48:13,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:48:13,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:48:13,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:48:13,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:48:13,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:48:13,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:48:13,089 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:48:13,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:48:13,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:48:13,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:48:13,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:48:13,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:48:13,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:48:13,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:48:13,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:48:13,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:48:13,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:48:13,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:48:13,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:48:13,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:48:13,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:48:13,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:48:13,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 10:48:13,102 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:48:13,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:48:13,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:48:13,103 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:48:13,103 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 10:48:13,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 10:48:13,104 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 10:48:13,105 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:48:13,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:48:13,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:48:13,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:48:13,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:48:13,107 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 10:48:13,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:48:13,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 10:48:13,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 10:48:13,107 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_faf8cb0e-04bd-49de-8c53-c7326f998072/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 -> 7540c95af84ce36a44a847aa5fc0422896a0f0bd [2018-12-02 10:48:13,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:48:13,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:48:13,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:48:13,134 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:48:13,134 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:48:13,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-02 10:48:13,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/data/5578aa505/73eb51b08076403bb64a0f9334d45ba8/FLAG7545d834e [2018-12-02 10:48:13,640 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:48:13,641 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-02 10:48:13,648 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/data/5578aa505/73eb51b08076403bb64a0f9334d45ba8/FLAG7545d834e [2018-12-02 10:48:13,657 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/data/5578aa505/73eb51b08076403bb64a0f9334d45ba8 [2018-12-02 10:48:13,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:48:13,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:48:13,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:13,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:48:13,662 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:48:13,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:13" (1/1) ... [2018-12-02 10:48:13,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725a737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:13, skipping insertion in model container [2018-12-02 10:48:13,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:48:13" (1/1) ... [2018-12-02 10:48:13,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:48:13,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:48:13,919 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:13,925 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:48:13,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:48:14,059 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:48:14,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14 WrapperNode [2018-12-02 10:48:14,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:48:14,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:14,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:48:14,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:48:14,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:48:14,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:48:14,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:48:14,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:48:14,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... [2018-12-02 10:48:14,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:48:14,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:48:14,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:48:14,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:48:14,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/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 10:48:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 10:48:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 10:48:14,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 10:48:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-02 10:48:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-02 10:48:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-02 10:48:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-02 10:48:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-02 10:48:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-02 10:48:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-02 10:48:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-02 10:48:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 10:48:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:48:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:48:14,154 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 10:48:14,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:48:14,345 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 10:48:14,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:14 BoogieIcfgContainer [2018-12-02 10:48:14,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:48:14,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:48:14,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:48:14,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:48:14,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:48:13" (1/3) ... [2018-12-02 10:48:14,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ba18a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:14, skipping insertion in model container [2018-12-02 10:48:14,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:48:14" (2/3) ... [2018-12-02 10:48:14,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ba18a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:48:14, skipping insertion in model container [2018-12-02 10:48:14,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:14" (3/3) ... [2018-12-02 10:48:14,352 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-12-02 10:48:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,378 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,378 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,379 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,380 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,383 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,384 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,385 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,386 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,387 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,388 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,389 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,390 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,391 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,393 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,394 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,394 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,395 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,395 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:48:14,495 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 10:48:14,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:48:14,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 10:48:14,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 10:48:14,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:48:14,530 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:48:14,530 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:48:14,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:48:14,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:48:14,530 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:48:14,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:48:14,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:48:14,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-12-02 10:48:16,916 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-12-02 10:48:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-12-02 10:48:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 10:48:16,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:16,923 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] [2018-12-02 10:48:16,924 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:16,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash 973446305, now seen corresponding path program 1 times [2018-12-02 10:48:16,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:16,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:16,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:16,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:17,148 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 10:48:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 10:48:17,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:17,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:48:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:48:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:48:17,162 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 10 states. [2018-12-02 10:48:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:17,872 INFO L93 Difference]: Finished difference Result 53969 states and 232570 transitions. [2018-12-02 10:48:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 10:48:17,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-02 10:48:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:18,020 INFO L225 Difference]: With dead ends: 53969 [2018-12-02 10:48:18,020 INFO L226 Difference]: Without dead ends: 38044 [2018-12-02 10:48:18,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2018-12-02 10:48:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 31405. [2018-12-02 10:48:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31405 states. [2018-12-02 10:48:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31405 states to 31405 states and 135819 transitions. [2018-12-02 10:48:18,829 INFO L78 Accepts]: Start accepts. Automaton has 31405 states and 135819 transitions. Word has length 31 [2018-12-02 10:48:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:18,829 INFO L480 AbstractCegarLoop]: Abstraction has 31405 states and 135819 transitions. [2018-12-02 10:48:18,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:48:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 31405 states and 135819 transitions. [2018-12-02 10:48:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 10:48:18,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:18,831 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] [2018-12-02 10:48:18,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:18,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash -320847025, now seen corresponding path program 2 times [2018-12-02 10:48:18,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:18,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:18,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:18,924 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 10:48:18,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:18,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 10:48:18,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:18,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:48:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:48:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:48:18,925 INFO L87 Difference]: Start difference. First operand 31405 states and 135819 transitions. Second operand 10 states. [2018-12-02 10:48:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:19,405 INFO L93 Difference]: Finished difference Result 44657 states and 198278 transitions. [2018-12-02 10:48:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 10:48:19,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-02 10:48:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:19,521 INFO L225 Difference]: With dead ends: 44657 [2018-12-02 10:48:19,521 INFO L226 Difference]: Without dead ends: 44657 [2018-12-02 10:48:19,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2018-12-02 10:48:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 31363. [2018-12-02 10:48:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-12-02 10:48:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-12-02 10:48:20,157 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-12-02 10:48:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-12-02 10:48:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:48:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-12-02 10:48:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 10:48:20,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:20,162 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] [2018-12-02 10:48:20,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:20,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash 931900819, now seen corresponding path program 1 times [2018-12-02 10:48:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:20,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:20,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:20,210 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 10:48:20,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:20,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:48:20,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:20,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:48:20,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:48:20,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:48:20,211 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 6 states. [2018-12-02 10:48:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:20,650 INFO L93 Difference]: Finished difference Result 67819 states and 285625 transitions. [2018-12-02 10:48:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:48:20,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-02 10:48:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:20,747 INFO L225 Difference]: With dead ends: 67819 [2018-12-02 10:48:20,747 INFO L226 Difference]: Without dead ends: 41885 [2018-12-02 10:48:20,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 10:48:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41885 states. [2018-12-02 10:48:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41885 to 32363. [2018-12-02 10:48:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32363 states. [2018-12-02 10:48:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32363 states to 32363 states and 134937 transitions. [2018-12-02 10:48:21,500 INFO L78 Accepts]: Start accepts. Automaton has 32363 states and 134937 transitions. Word has length 41 [2018-12-02 10:48:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:21,500 INFO L480 AbstractCegarLoop]: Abstraction has 32363 states and 134937 transitions. [2018-12-02 10:48:21,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:48:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32363 states and 134937 transitions. [2018-12-02 10:48:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 10:48:21,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:21,506 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 10:48:21,506 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2024466476, now seen corresponding path program 1 times [2018-12-02 10:48:21,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:21,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:21,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:21,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 10:48:21,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:21,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:48:21,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:21,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:21,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:21,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:21,569 INFO L87 Difference]: Start difference. First operand 32363 states and 134937 transitions. Second operand 7 states. [2018-12-02 10:48:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:21,867 INFO L93 Difference]: Finished difference Result 39181 states and 163715 transitions. [2018-12-02 10:48:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:48:21,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-02 10:48:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:21,943 INFO L225 Difference]: With dead ends: 39181 [2018-12-02 10:48:21,943 INFO L226 Difference]: Without dead ends: 39109 [2018-12-02 10:48:21,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 10:48:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2018-12-02 10:48:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 35466. [2018-12-02 10:48:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-12-02 10:48:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-12-02 10:48:22,525 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-12-02 10:48:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:22,525 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-12-02 10:48:22,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-12-02 10:48:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 10:48:22,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:22,531 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 10:48:22,531 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:22,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1156791892, now seen corresponding path program 2 times [2018-12-02 10:48:22,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:22,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:22,626 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 10:48:22,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:22,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 10:48:22,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:22,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:48:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:48:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:48:22,627 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-12-02 10:48:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:23,171 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-12-02 10:48:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 10:48:23,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-02 10:48:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:23,253 INFO L225 Difference]: With dead ends: 49948 [2018-12-02 10:48:23,253 INFO L226 Difference]: Without dead ends: 45132 [2018-12-02 10:48:23,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-02 10:48:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-12-02 10:48:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-12-02 10:48:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-12-02 10:48:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-12-02 10:48:23,841 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-12-02 10:48:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:23,842 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-12-02 10:48:23,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:48:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-12-02 10:48:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 10:48:23,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:23,849 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] [2018-12-02 10:48:23,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:23,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 868178546, now seen corresponding path program 1 times [2018-12-02 10:48:23,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:23,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:23,908 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 10:48:23,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:23,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:48:23,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:23,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:23,909 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 7 states. [2018-12-02 10:48:24,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:24,197 INFO L93 Difference]: Finished difference Result 38268 states and 158857 transitions. [2018-12-02 10:48:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:48:24,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-02 10:48:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:24,268 INFO L225 Difference]: With dead ends: 38268 [2018-12-02 10:48:24,268 INFO L226 Difference]: Without dead ends: 37788 [2018-12-02 10:48:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 10:48:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37788 states. [2018-12-02 10:48:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37788 to 36092. [2018-12-02 10:48:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-12-02 10:48:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-12-02 10:48:24,921 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-12-02 10:48:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:24,921 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-12-02 10:48:24,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-12-02 10:48:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 10:48:24,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:24,929 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] [2018-12-02 10:48:24,929 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:24,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -108546428, now seen corresponding path program 2 times [2018-12-02 10:48:24,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:24,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:25,253 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 10:48:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:25,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 10:48:25,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 10:48:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:48:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:25,254 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-12-02 10:48:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:26,244 INFO L93 Difference]: Finished difference Result 43003 states and 180466 transitions. [2018-12-02 10:48:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 10:48:26,245 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-02 10:48:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:26,326 INFO L225 Difference]: With dead ends: 43003 [2018-12-02 10:48:26,326 INFO L226 Difference]: Without dead ends: 42757 [2018-12-02 10:48:26,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-12-02 10:48:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42757 states. [2018-12-02 10:48:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42757 to 39101. [2018-12-02 10:48:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39101 states. [2018-12-02 10:48:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39101 states to 39101 states and 165551 transitions. [2018-12-02 10:48:26,967 INFO L78 Accepts]: Start accepts. Automaton has 39101 states and 165551 transitions. Word has length 44 [2018-12-02 10:48:26,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:26,968 INFO L480 AbstractCegarLoop]: Abstraction has 39101 states and 165551 transitions. [2018-12-02 10:48:26,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 10:48:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39101 states and 165551 transitions. [2018-12-02 10:48:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 10:48:26,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:26,978 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] [2018-12-02 10:48:26,978 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:26,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:26,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1310405846, now seen corresponding path program 3 times [2018-12-02 10:48:26,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:26,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:26,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:27,182 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 10:48:27,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:27,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 10:48:27,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:27,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 10:48:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 10:48:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-02 10:48:27,183 INFO L87 Difference]: Start difference. First operand 39101 states and 165551 transitions. Second operand 14 states. [2018-12-02 10:48:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:27,785 INFO L93 Difference]: Finished difference Result 52387 states and 222062 transitions. [2018-12-02 10:48:27,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 10:48:27,786 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-12-02 10:48:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:27,890 INFO L225 Difference]: With dead ends: 52387 [2018-12-02 10:48:27,890 INFO L226 Difference]: Without dead ends: 52141 [2018-12-02 10:48:27,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-02 10:48:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52141 states. [2018-12-02 10:48:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52141 to 39028. [2018-12-02 10:48:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2018-12-02 10:48:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2018-12-02 10:48:28,576 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 44 [2018-12-02 10:48:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:28,576 INFO L480 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2018-12-02 10:48:28,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 10:48:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2018-12-02 10:48:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:28,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:28,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:28,590 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1031346498, now seen corresponding path program 1 times [2018-12-02 10:48:28,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:28,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:28,712 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 10:48:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:28,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 10:48:28,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:28,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 10:48:28,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 10:48:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 10:48:28,713 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 12 states. [2018-12-02 10:48:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:29,173 INFO L93 Difference]: Finished difference Result 55533 states and 228155 transitions. [2018-12-02 10:48:29,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 10:48:29,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-02 10:48:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:29,265 INFO L225 Difference]: With dead ends: 55533 [2018-12-02 10:48:29,265 INFO L226 Difference]: Without dead ends: 48889 [2018-12-02 10:48:29,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-12-02 10:48:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2018-12-02 10:48:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 38756. [2018-12-02 10:48:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38756 states. [2018-12-02 10:48:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 164262 transitions. [2018-12-02 10:48:30,091 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 164262 transitions. Word has length 46 [2018-12-02 10:48:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:30,091 INFO L480 AbstractCegarLoop]: Abstraction has 38756 states and 164262 transitions. [2018-12-02 10:48:30,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 10:48:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 164262 transitions. [2018-12-02 10:48:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:30,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:30,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:30,104 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:30,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash -165686462, now seen corresponding path program 1 times [2018-12-02 10:48:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:30,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:30,491 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 10:48:30,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 10:48:30,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:30,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 10:48:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:48:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:30,493 INFO L87 Difference]: Start difference. First operand 38756 states and 164262 transitions. Second operand 17 states. [2018-12-02 10:48:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:31,230 INFO L93 Difference]: Finished difference Result 47709 states and 201870 transitions. [2018-12-02 10:48:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 10:48:31,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 10:48:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:31,321 INFO L225 Difference]: With dead ends: 47709 [2018-12-02 10:48:31,322 INFO L226 Difference]: Without dead ends: 47403 [2018-12-02 10:48:31,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-12-02 10:48:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47403 states. [2018-12-02 10:48:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47403 to 40796. [2018-12-02 10:48:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40796 states. [2018-12-02 10:48:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 173951 transitions. [2018-12-02 10:48:31,995 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 173951 transitions. Word has length 46 [2018-12-02 10:48:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:31,995 INFO L480 AbstractCegarLoop]: Abstraction has 40796 states and 173951 transitions. [2018-12-02 10:48:31,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 10:48:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 173951 transitions. [2018-12-02 10:48:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:32,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:32,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:32,009 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:32,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1433815393, now seen corresponding path program 1 times [2018-12-02 10:48:32,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:32,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:32,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:32,355 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 10:48:32,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:32,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 10:48:32,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:32,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 10:48:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:48:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:32,356 INFO L87 Difference]: Start difference. First operand 40796 states and 173951 transitions. Second operand 17 states. [2018-12-02 10:48:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:33,222 INFO L93 Difference]: Finished difference Result 48941 states and 207557 transitions. [2018-12-02 10:48:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 10:48:33,222 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 10:48:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:33,316 INFO L225 Difference]: With dead ends: 48941 [2018-12-02 10:48:33,316 INFO L226 Difference]: Without dead ends: 48635 [2018-12-02 10:48:33,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-02 10:48:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2018-12-02 10:48:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 40772. [2018-12-02 10:48:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-12-02 10:48:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-12-02 10:48:34,197 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-12-02 10:48:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:34,197 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-12-02 10:48:34,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 10:48:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-12-02 10:48:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:34,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:34,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:34,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash 299199095, now seen corresponding path program 2 times [2018-12-02 10:48:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:34,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:34,532 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 10:48:34,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:34,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-02 10:48:34,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:34,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 10:48:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 10:48:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:48:34,533 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 17 states. [2018-12-02 10:48:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:35,610 INFO L93 Difference]: Finished difference Result 49993 states and 209684 transitions. [2018-12-02 10:48:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 10:48:35,610 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-02 10:48:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:35,707 INFO L225 Difference]: With dead ends: 49993 [2018-12-02 10:48:35,708 INFO L226 Difference]: Without dead ends: 49687 [2018-12-02 10:48:35,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 10:48:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49687 states. [2018-12-02 10:48:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49687 to 38645. [2018-12-02 10:48:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-12-02 10:48:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-12-02 10:48:36,382 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-12-02 10:48:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:36,382 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-12-02 10:48:36,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 10:48:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-12-02 10:48:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:36,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:36,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:36,395 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1385009275, now seen corresponding path program 1 times [2018-12-02 10:48:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:36,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:36,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:36,817 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 10:48:36,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:36,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:48:36,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:36,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:48:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:48:36,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:48:36,818 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 19 states. [2018-12-02 10:48:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:37,748 INFO L93 Difference]: Finished difference Result 48949 states and 208196 transitions. [2018-12-02 10:48:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 10:48:37,749 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-02 10:48:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:37,847 INFO L225 Difference]: With dead ends: 48949 [2018-12-02 10:48:37,847 INFO L226 Difference]: Without dead ends: 48703 [2018-12-02 10:48:37,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-02 10:48:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2018-12-02 10:48:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 38308. [2018-12-02 10:48:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38308 states. [2018-12-02 10:48:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38308 states to 38308 states and 162641 transitions. [2018-12-02 10:48:38,600 INFO L78 Accepts]: Start accepts. Automaton has 38308 states and 162641 transitions. Word has length 46 [2018-12-02 10:48:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:38,600 INFO L480 AbstractCegarLoop]: Abstraction has 38308 states and 162641 transitions. [2018-12-02 10:48:38,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:48:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38308 states and 162641 transitions. [2018-12-02 10:48:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:48:38,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:38,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:38,613 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:38,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 620423234, now seen corresponding path program 2 times [2018-12-02 10:48:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:38,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:38,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:38,709 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 10:48:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:38,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 10:48:38,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:38,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 10:48:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 10:48:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-02 10:48:38,710 INFO L87 Difference]: Start difference. First operand 38308 states and 162641 transitions. Second operand 12 states. [2018-12-02 10:48:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:39,145 INFO L93 Difference]: Finished difference Result 52333 states and 220932 transitions. [2018-12-02 10:48:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 10:48:39,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-02 10:48:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:39,252 INFO L225 Difference]: With dead ends: 52333 [2018-12-02 10:48:39,252 INFO L226 Difference]: Without dead ends: 52027 [2018-12-02 10:48:39,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-12-02 10:48:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2018-12-02 10:48:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 38150. [2018-12-02 10:48:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38150 states. [2018-12-02 10:48:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 162226 transitions. [2018-12-02 10:48:39,936 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 162226 transitions. Word has length 46 [2018-12-02 10:48:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:39,936 INFO L480 AbstractCegarLoop]: Abstraction has 38150 states and 162226 transitions. [2018-12-02 10:48:39,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 10:48:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 162226 transitions. [2018-12-02 10:48:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 10:48:39,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:39,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:39,954 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:39,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2011508605, now seen corresponding path program 1 times [2018-12-02 10:48:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:39,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:39,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:39,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:40,385 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 10:48:40,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:40,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:48:40,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:40,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:48:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:48:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:48:40,387 INFO L87 Difference]: Start difference. First operand 38150 states and 162226 transitions. Second operand 19 states. [2018-12-02 10:48:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:41,276 INFO L93 Difference]: Finished difference Result 46294 states and 195371 transitions. [2018-12-02 10:48:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 10:48:41,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-02 10:48:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:41,365 INFO L225 Difference]: With dead ends: 46294 [2018-12-02 10:48:41,366 INFO L226 Difference]: Without dead ends: 45988 [2018-12-02 10:48:41,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-12-02 10:48:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45988 states. [2018-12-02 10:48:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45988 to 36584. [2018-12-02 10:48:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36584 states. [2018-12-02 10:48:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36584 states to 36584 states and 155048 transitions. [2018-12-02 10:48:41,991 INFO L78 Accepts]: Start accepts. Automaton has 36584 states and 155048 transitions. Word has length 48 [2018-12-02 10:48:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:41,991 INFO L480 AbstractCegarLoop]: Abstraction has 36584 states and 155048 transitions. [2018-12-02 10:48:41,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:48:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36584 states and 155048 transitions. [2018-12-02 10:48:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 10:48:42,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:42,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:42,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:42,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1488816992, now seen corresponding path program 1 times [2018-12-02 10:48:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:42,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:42,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:42,514 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 10:48:42,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:42,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:48:42,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:42,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:48:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:48:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:48:42,515 INFO L87 Difference]: Start difference. First operand 36584 states and 155048 transitions. Second operand 19 states. [2018-12-02 10:48:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:44,286 INFO L93 Difference]: Finished difference Result 42873 states and 179744 transitions. [2018-12-02 10:48:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 10:48:44,287 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-02 10:48:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:44,364 INFO L225 Difference]: With dead ends: 42873 [2018-12-02 10:48:44,364 INFO L226 Difference]: Without dead ends: 42567 [2018-12-02 10:48:44,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 10:48:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42567 states. [2018-12-02 10:48:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42567 to 34160. [2018-12-02 10:48:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-12-02 10:48:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-12-02 10:48:44,934 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-12-02 10:48:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-12-02 10:48:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:48:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-12-02 10:48:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:44,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:44,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:44,952 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:44,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1732785392, now seen corresponding path program 1 times [2018-12-02 10:48:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:44,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:44,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:44,993 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 10:48:44,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:48:44,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:44,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:48:44,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:48:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:48:44,994 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 7 states. [2018-12-02 10:48:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:45,268 INFO L93 Difference]: Finished difference Result 38880 states and 161858 transitions. [2018-12-02 10:48:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:48:45,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-02 10:48:45,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:45,341 INFO L225 Difference]: With dead ends: 38880 [2018-12-02 10:48:45,341 INFO L226 Difference]: Without dead ends: 38046 [2018-12-02 10:48:45,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 10:48:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2018-12-02 10:48:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 36228. [2018-12-02 10:48:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-12-02 10:48:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-12-02 10:48:45,914 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-12-02 10:48:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:45,915 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-12-02 10:48:45,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:48:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-12-02 10:48:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:45,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:45,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:45,932 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:45,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1459685517, now seen corresponding path program 1 times [2018-12-02 10:48:45,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:45,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:45,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:46,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 10:48:46,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:46,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 10:48:46,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:46,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 10:48:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 10:48:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-02 10:48:46,094 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 14 states. [2018-12-02 10:48:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:46,672 INFO L93 Difference]: Finished difference Result 55817 states and 227535 transitions. [2018-12-02 10:48:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 10:48:46,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-12-02 10:48:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:46,750 INFO L225 Difference]: With dead ends: 55817 [2018-12-02 10:48:46,750 INFO L226 Difference]: Without dead ends: 41649 [2018-12-02 10:48:46,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-12-02 10:48:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2018-12-02 10:48:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 31649. [2018-12-02 10:48:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2018-12-02 10:48:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 132071 transitions. [2018-12-02 10:48:47,310 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 132071 transitions. Word has length 49 [2018-12-02 10:48:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:47,311 INFO L480 AbstractCegarLoop]: Abstraction has 31649 states and 132071 transitions. [2018-12-02 10:48:47,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 10:48:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 132071 transitions. [2018-12-02 10:48:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:47,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:47,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:47,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:47,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash -114085722, now seen corresponding path program 1 times [2018-12-02 10:48:47,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:47,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:47,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:47,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:47,942 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 10:48:47,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:47,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:48:47,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:47,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:48:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:48:47,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:48:47,943 INFO L87 Difference]: Start difference. First operand 31649 states and 132071 transitions. Second operand 21 states. [2018-12-02 10:48:48,444 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-12-02 10:48:48,575 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-12-02 10:48:49,132 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2018-12-02 10:48:49,277 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-12-02 10:48:50,200 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2018-12-02 10:48:50,583 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2018-12-02 10:48:51,023 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-12-02 10:48:51,394 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2018-12-02 10:48:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:52,022 INFO L93 Difference]: Finished difference Result 55168 states and 228464 transitions. [2018-12-02 10:48:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 10:48:52,022 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-02 10:48:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:52,126 INFO L225 Difference]: With dead ends: 55168 [2018-12-02 10:48:52,126 INFO L226 Difference]: Without dead ends: 54346 [2018-12-02 10:48:52,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 10:48:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54346 states. [2018-12-02 10:48:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54346 to 35364. [2018-12-02 10:48:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-02 10:48:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-02 10:48:52,771 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-02 10:48:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:52,771 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-02 10:48:52,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:48:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-02 10:48:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:52,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:52,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:52,791 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:52,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:52,791 INFO L82 PathProgramCache]: Analyzing trace with hash -672953966, now seen corresponding path program 2 times [2018-12-02 10:48:52,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:52,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:52,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:53,009 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 10:48:53,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:53,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 10:48:53,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:53,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 10:48:53,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 10:48:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 10:48:53,010 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 16 states. [2018-12-02 10:48:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:53,336 INFO L93 Difference]: Finished difference Result 39597 states and 166907 transitions. [2018-12-02 10:48:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 10:48:53,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-02 10:48:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:53,411 INFO L225 Difference]: With dead ends: 39597 [2018-12-02 10:48:53,411 INFO L226 Difference]: Without dead ends: 38958 [2018-12-02 10:48:53,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-12-02 10:48:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38958 states. [2018-12-02 10:48:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38958 to 35364. [2018-12-02 10:48:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-02 10:48:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-02 10:48:53,971 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-02 10:48:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:53,971 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-02 10:48:53,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 10:48:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-02 10:48:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:53,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:53,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:53,990 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1155264282, now seen corresponding path program 3 times [2018-12-02 10:48:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:53,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:53,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:48:54,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:54,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:48:54,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:48:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:48:54,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:48:54,369 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 19 states. [2018-12-02 10:48:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:55,605 INFO L93 Difference]: Finished difference Result 41619 states and 175078 transitions. [2018-12-02 10:48:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 10:48:55,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-02 10:48:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:55,684 INFO L225 Difference]: With dead ends: 41619 [2018-12-02 10:48:55,684 INFO L226 Difference]: Without dead ends: 40980 [2018-12-02 10:48:55,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-12-02 10:48:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40980 states. [2018-12-02 10:48:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40980 to 35412. [2018-12-02 10:48:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35412 states. [2018-12-02 10:48:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35412 states to 35412 states and 150956 transitions. [2018-12-02 10:48:56,261 INFO L78 Accepts]: Start accepts. Automaton has 35412 states and 150956 transitions. Word has length 49 [2018-12-02 10:48:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:56,261 INFO L480 AbstractCegarLoop]: Abstraction has 35412 states and 150956 transitions. [2018-12-02 10:48:56,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:48:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 35412 states and 150956 transitions. [2018-12-02 10:48:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 10:48:56,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:56,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:48:56,281 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:56,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1728037470, now seen corresponding path program 4 times [2018-12-02 10:48:56,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:56,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:48:56,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:56,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:56,505 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 10:48:56,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:56,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 10:48:56,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:56,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 10:48:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 10:48:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 10:48:56,507 INFO L87 Difference]: Start difference. First operand 35412 states and 150956 transitions. Second operand 16 states. [2018-12-02 10:48:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:48:57,007 INFO L93 Difference]: Finished difference Result 44552 states and 186042 transitions. [2018-12-02 10:48:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 10:48:57,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-02 10:48:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:48:57,092 INFO L225 Difference]: With dead ends: 44552 [2018-12-02 10:48:57,092 INFO L226 Difference]: Without dead ends: 43913 [2018-12-02 10:48:57,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-02 10:48:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43913 states. [2018-12-02 10:48:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43913 to 34825. [2018-12-02 10:48:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34825 states. [2018-12-02 10:48:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 148359 transitions. [2018-12-02 10:48:57,756 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 148359 transitions. Word has length 49 [2018-12-02 10:48:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:48:57,756 INFO L480 AbstractCegarLoop]: Abstraction has 34825 states and 148359 transitions. [2018-12-02 10:48:57,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 10:48:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 148359 transitions. [2018-12-02 10:48:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:48:57,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:48:57,779 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] [2018-12-02 10:48:57,779 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:48:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:48:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash 568200004, now seen corresponding path program 1 times [2018-12-02 10:48:57,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:48:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:57,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:48:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:48:57,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:48:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:48:58,479 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 10:48:58,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:48:58,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:48:58,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:48:58,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:48:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:48:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:48:58,480 INFO L87 Difference]: Start difference. First operand 34825 states and 148359 transitions. Second operand 21 states. [2018-12-02 10:48:58,959 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-12-02 10:48:59,091 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-12-02 10:49:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:00,633 INFO L93 Difference]: Finished difference Result 36224 states and 150699 transitions. [2018-12-02 10:49:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 10:49:00,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 10:49:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:00,700 INFO L225 Difference]: With dead ends: 36224 [2018-12-02 10:49:00,700 INFO L226 Difference]: Without dead ends: 35180 [2018-12-02 10:49:00,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 10:49:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2018-12-02 10:49:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 29756. [2018-12-02 10:49:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2018-12-02 10:49:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 124486 transitions. [2018-12-02 10:49:01,192 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 124486 transitions. Word has length 51 [2018-12-02 10:49:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:01,192 INFO L480 AbstractCegarLoop]: Abstraction has 29756 states and 124486 transitions. [2018-12-02 10:49:01,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 124486 transitions. [2018-12-02 10:49:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:01,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:01,214 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] [2018-12-02 10:49:01,214 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:01,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash 845920999, now seen corresponding path program 1 times [2018-12-02 10:49:01,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:01,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:01,725 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 10:49:01,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:01,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:01,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:01,726 INFO L87 Difference]: Start difference. First operand 29756 states and 124486 transitions. Second operand 21 states. [2018-12-02 10:49:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:03,129 INFO L93 Difference]: Finished difference Result 37835 states and 157450 transitions. [2018-12-02 10:49:03,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 10:49:03,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 10:49:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:03,199 INFO L225 Difference]: With dead ends: 37835 [2018-12-02 10:49:03,200 INFO L226 Difference]: Without dead ends: 36917 [2018-12-02 10:49:03,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 10:49:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2018-12-02 10:49:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 25502. [2018-12-02 10:49:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25502 states. [2018-12-02 10:49:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25502 states to 25502 states and 105052 transitions. [2018-12-02 10:49:03,672 INFO L78 Accepts]: Start accepts. Automaton has 25502 states and 105052 transitions. Word has length 51 [2018-12-02 10:49:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:03,672 INFO L480 AbstractCegarLoop]: Abstraction has 25502 states and 105052 transitions. [2018-12-02 10:49:03,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 25502 states and 105052 transitions. [2018-12-02 10:49:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:03,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:03,691 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] [2018-12-02 10:49:03,691 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:03,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 531858785, now seen corresponding path program 2 times [2018-12-02 10:49:03,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:03,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:03,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:03,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:49:04,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:04,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:04,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:04,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:04,490 INFO L87 Difference]: Start difference. First operand 25502 states and 105052 transitions. Second operand 21 states. [2018-12-02 10:49:05,170 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2018-12-02 10:49:05,614 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-12-02 10:49:06,175 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2018-12-02 10:49:06,733 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-02 10:49:07,104 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:49:07,666 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-12-02 10:49:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:08,513 INFO L93 Difference]: Finished difference Result 38880 states and 159223 transitions. [2018-12-02 10:49:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 10:49:08,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 10:49:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:08,600 INFO L225 Difference]: With dead ends: 38880 [2018-12-02 10:49:08,601 INFO L226 Difference]: Without dead ends: 38574 [2018-12-02 10:49:08,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 10:49:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2018-12-02 10:49:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 20447. [2018-12-02 10:49:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2018-12-02 10:49:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 83415 transitions. [2018-12-02 10:49:09,015 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 83415 transitions. Word has length 51 [2018-12-02 10:49:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:09,015 INFO L480 AbstractCegarLoop]: Abstraction has 20447 states and 83415 transitions. [2018-12-02 10:49:09,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 83415 transitions. [2018-12-02 10:49:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:09,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:09,029 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] [2018-12-02 10:49:09,029 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:09,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -604065647, now seen corresponding path program 1 times [2018-12-02 10:49:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:09,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:09,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:09,483 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 10:49:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:49:09,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:09,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:49:09,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:49:09,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:49:09,484 INFO L87 Difference]: Start difference. First operand 20447 states and 83415 transitions. Second operand 19 states. [2018-12-02 10:49:09,808 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-12-02 10:49:10,074 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-02 10:49:10,627 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-02 10:49:10,861 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-02 10:49:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:11,594 INFO L93 Difference]: Finished difference Result 25964 states and 104818 transitions. [2018-12-02 10:49:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 10:49:11,594 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-02 10:49:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:11,636 INFO L225 Difference]: With dead ends: 25964 [2018-12-02 10:49:11,637 INFO L226 Difference]: Without dead ends: 25595 [2018-12-02 10:49:11,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2018-12-02 10:49:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2018-12-02 10:49:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 20399. [2018-12-02 10:49:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-12-02 10:49:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-12-02 10:49:11,966 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 51 [2018-12-02 10:49:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:11,966 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-12-02 10:49:11,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:49:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-12-02 10:49:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:11,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:11,980 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] [2018-12-02 10:49:11,980 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:11,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1659149151, now seen corresponding path program 2 times [2018-12-02 10:49:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:11,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:11,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:12,467 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 10:49:12,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:12,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 10:49:12,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:12,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 10:49:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 10:49:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:49:12,468 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 19 states. [2018-12-02 10:49:13,088 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-02 10:49:13,299 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-02 10:49:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:14,002 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-12-02 10:49:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 10:49:14,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-02 10:49:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:14,049 INFO L225 Difference]: With dead ends: 27038 [2018-12-02 10:49:14,049 INFO L226 Difference]: Without dead ends: 26669 [2018-12-02 10:49:14,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 10:49:14,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-12-02 10:49:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-12-02 10:49:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-02 10:49:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-12-02 10:49:14,385 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-12-02 10:49:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:14,385 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-12-02 10:49:14,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 10:49:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-12-02 10:49:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:14,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:14,398 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] [2018-12-02 10:49:14,398 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:14,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1841104979, now seen corresponding path program 1 times [2018-12-02 10:49:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:14,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:14,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:14,755 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 10:49:14,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:14,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 10:49:14,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:14,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 10:49:14,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 10:49:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-02 10:49:14,756 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-12-02 10:49:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:15,386 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-12-02 10:49:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 10:49:15,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-02 10:49:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:15,431 INFO L225 Difference]: With dead ends: 26099 [2018-12-02 10:49:15,431 INFO L226 Difference]: Without dead ends: 25550 [2018-12-02 10:49:15,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-12-02 10:49:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-12-02 10:49:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-12-02 10:49:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-12-02 10:49:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-12-02 10:49:15,760 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-12-02 10:49:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:15,761 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-12-02 10:49:15,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 10:49:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-12-02 10:49:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 10:49:15,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:15,774 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] [2018-12-02 10:49:15,774 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:15,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1358794663, now seen corresponding path program 2 times [2018-12-02 10:49:15,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:15,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:15,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:15,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:49:16,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:16,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:16,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:16,350 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-12-02 10:49:17,005 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-12-02 10:49:17,237 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-12-02 10:49:17,783 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2018-12-02 10:49:18,582 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-12-02 10:49:18,880 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-02 10:49:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:19,358 INFO L93 Difference]: Finished difference Result 24529 states and 99196 transitions. [2018-12-02 10:49:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 10:49:19,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-02 10:49:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:19,397 INFO L225 Difference]: With dead ends: 24529 [2018-12-02 10:49:19,397 INFO L226 Difference]: Without dead ends: 22702 [2018-12-02 10:49:19,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 10:49:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2018-12-02 10:49:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 17110. [2018-12-02 10:49:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2018-12-02 10:49:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 69704 transitions. [2018-12-02 10:49:19,679 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 69704 transitions. Word has length 51 [2018-12-02 10:49:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:19,679 INFO L480 AbstractCegarLoop]: Abstraction has 17110 states and 69704 transitions. [2018-12-02 10:49:19,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 69704 transitions. [2018-12-02 10:49:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 10:49:19,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:19,691 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] [2018-12-02 10:49:19,691 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:19,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:19,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1212252299, now seen corresponding path program 1 times [2018-12-02 10:49:19,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:19,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:19,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:19,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:19,727 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 10:49:19,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:19,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:49:19,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:19,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:49:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:49:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:49:19,728 INFO L87 Difference]: Start difference. First operand 17110 states and 69704 transitions. Second operand 7 states. [2018-12-02 10:49:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:19,926 INFO L93 Difference]: Finished difference Result 20102 states and 80003 transitions. [2018-12-02 10:49:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:49:19,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-02 10:49:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:19,957 INFO L225 Difference]: With dead ends: 20102 [2018-12-02 10:49:19,958 INFO L226 Difference]: Without dead ends: 19382 [2018-12-02 10:49:19,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 10:49:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19382 states. [2018-12-02 10:49:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19382 to 18962. [2018-12-02 10:49:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18962 states. [2018-12-02 10:49:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18962 states to 18962 states and 76406 transitions. [2018-12-02 10:49:20,226 INFO L78 Accepts]: Start accepts. Automaton has 18962 states and 76406 transitions. Word has length 52 [2018-12-02 10:49:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:20,226 INFO L480 AbstractCegarLoop]: Abstraction has 18962 states and 76406 transitions. [2018-12-02 10:49:20,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:49:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18962 states and 76406 transitions. [2018-12-02 10:49:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 10:49:20,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:20,241 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] [2018-12-02 10:49:20,241 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:20,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:20,241 INFO L82 PathProgramCache]: Analyzing trace with hash -602885373, now seen corresponding path program 2 times [2018-12-02 10:49:20,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:20,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:20,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:20,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:20,787 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 10:49:20,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:20,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:20,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:20,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:20,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:20,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:20,788 INFO L87 Difference]: Start difference. First operand 18962 states and 76406 transitions. Second operand 21 states. [2018-12-02 10:49:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:22,185 INFO L93 Difference]: Finished difference Result 24590 states and 97599 transitions. [2018-12-02 10:49:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 10:49:22,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-02 10:49:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:22,220 INFO L225 Difference]: With dead ends: 24590 [2018-12-02 10:49:22,220 INFO L226 Difference]: Without dead ends: 22430 [2018-12-02 10:49:22,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 10:49:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2018-12-02 10:49:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18290. [2018-12-02 10:49:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2018-12-02 10:49:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 73678 transitions. [2018-12-02 10:49:22,500 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 73678 transitions. Word has length 52 [2018-12-02 10:49:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:22,500 INFO L480 AbstractCegarLoop]: Abstraction has 18290 states and 73678 transitions. [2018-12-02 10:49:22,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 73678 transitions. [2018-12-02 10:49:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 10:49:22,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:22,514 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] [2018-12-02 10:49:22,514 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:22,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -645490969, now seen corresponding path program 3 times [2018-12-02 10:49:22,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:22,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:22,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:22,859 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 10:49:22,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:22,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 10:49:22,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:22,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 10:49:22,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 10:49:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-02 10:49:22,860 INFO L87 Difference]: Start difference. First operand 18290 states and 73678 transitions. Second operand 18 states. [2018-12-02 10:49:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:23,315 INFO L93 Difference]: Finished difference Result 24227 states and 94267 transitions. [2018-12-02 10:49:23,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 10:49:23,315 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-02 10:49:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:23,350 INFO L225 Difference]: With dead ends: 24227 [2018-12-02 10:49:23,350 INFO L226 Difference]: Without dead ends: 23507 [2018-12-02 10:49:23,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-12-02 10:49:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2018-12-02 10:49:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 17551. [2018-12-02 10:49:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17551 states. [2018-12-02 10:49:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17551 states to 17551 states and 70727 transitions. [2018-12-02 10:49:23,618 INFO L78 Accepts]: Start accepts. Automaton has 17551 states and 70727 transitions. Word has length 52 [2018-12-02 10:49:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:23,619 INFO L480 AbstractCegarLoop]: Abstraction has 17551 states and 70727 transitions. [2018-12-02 10:49:23,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 10:49:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17551 states and 70727 transitions. [2018-12-02 10:49:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 10:49:23,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:23,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:49:23,632 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:23,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash -676697198, now seen corresponding path program 1 times [2018-12-02 10:49:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:23,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:23,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:23,971 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-02 10:49:24,282 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-02 10:49:24,598 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-12-02 10:49:24,905 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-02 10:49:25,372 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 10:49:25,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:25,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:25,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:25,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:25,373 INFO L87 Difference]: Start difference. First operand 17551 states and 70727 transitions. Second operand 21 states. [2018-12-02 10:49:25,723 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-12-02 10:49:26,187 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-12-02 10:49:26,761 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-12-02 10:49:27,496 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2018-12-02 10:49:28,191 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-12-02 10:49:28,765 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2018-12-02 10:49:29,200 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2018-12-02 10:49:30,606 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:49:30,915 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-02 10:49:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:30,972 INFO L93 Difference]: Finished difference Result 25327 states and 100129 transitions. [2018-12-02 10:49:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 10:49:30,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-12-02 10:49:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:31,010 INFO L225 Difference]: With dead ends: 25327 [2018-12-02 10:49:31,010 INFO L226 Difference]: Without dead ends: 25012 [2018-12-02 10:49:31,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 10:49:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25012 states. [2018-12-02 10:49:31,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25012 to 13402. [2018-12-02 10:49:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2018-12-02 10:49:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 53709 transitions. [2018-12-02 10:49:31,252 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 53709 transitions. Word has length 53 [2018-12-02 10:49:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:31,252 INFO L480 AbstractCegarLoop]: Abstraction has 13402 states and 53709 transitions. [2018-12-02 10:49:31,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 53709 transitions. [2018-12-02 10:49:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 10:49:31,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:31,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:49:31,265 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:31,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1294667716, now seen corresponding path program 1 times [2018-12-02 10:49:31,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:31,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:31,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:31,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:32,187 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 10:49:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:32,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:32,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:32,189 INFO L87 Difference]: Start difference. First operand 13402 states and 53709 transitions. Second operand 21 states. [2018-12-02 10:49:32,766 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-12-02 10:49:33,137 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-12-02 10:49:33,700 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-02 10:49:34,111 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-12-02 10:49:34,509 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-12-02 10:49:34,855 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-12-02 10:49:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:36,399 INFO L93 Difference]: Finished difference Result 22774 states and 89010 transitions. [2018-12-02 10:49:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 10:49:36,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-02 10:49:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:36,437 INFO L225 Difference]: With dead ends: 22774 [2018-12-02 10:49:36,437 INFO L226 Difference]: Without dead ends: 22198 [2018-12-02 10:49:36,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 10:49:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-12-02 10:49:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 12634. [2018-12-02 10:49:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-12-02 10:49:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-12-02 10:49:36,669 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 54 [2018-12-02 10:49:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:36,669 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-12-02 10:49:36,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-12-02 10:49:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 10:49:36,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:36,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:49:36,680 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:36,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1387947128, now seen corresponding path program 2 times [2018-12-02 10:49:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:36,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:36,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:36,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:49:37,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:37,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-02 10:49:37,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:37,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 10:49:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 10:49:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-02 10:49:37,428 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 21 states. [2018-12-02 10:49:38,107 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-02 10:49:38,476 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-12-02 10:49:38,796 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-12-02 10:49:39,221 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-02 10:49:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:40,231 INFO L93 Difference]: Finished difference Result 12034 states and 46239 transitions. [2018-12-02 10:49:40,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 10:49:40,231 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-02 10:49:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:40,246 INFO L225 Difference]: With dead ends: 12034 [2018-12-02 10:49:40,246 INFO L226 Difference]: Without dead ends: 11458 [2018-12-02 10:49:40,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2018-12-02 10:49:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2018-12-02 10:49:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6913. [2018-12-02 10:49:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-12-02 10:49:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-12-02 10:49:40,357 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-12-02 10:49:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:40,357 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-12-02 10:49:40,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 10:49:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-12-02 10:49:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 10:49:40,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:40,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:49:40,366 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:40,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash 571526352, now seen corresponding path program 1 times [2018-12-02 10:49:40,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:49:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:40,422 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 10:49:40,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:40,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:49:40,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:40,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:49:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:49:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:49:40,423 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 9 states. [2018-12-02 10:49:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:40,552 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-12-02 10:49:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:49:40,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-02 10:49:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:40,562 INFO L225 Difference]: With dead ends: 6913 [2018-12-02 10:49:40,562 INFO L226 Difference]: Without dead ends: 6868 [2018-12-02 10:49:40,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-02 10:49:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-12-02 10:49:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-12-02 10:49:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-12-02 10:49:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-12-02 10:49:40,654 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-12-02 10:49:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:40,654 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-12-02 10:49:40,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:49:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-12-02 10:49:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 10:49:40,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:40,662 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] [2018-12-02 10:49:40,663 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:40,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 271857695, now seen corresponding path program 1 times [2018-12-02 10:49:40,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:40,736 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 10:49:40,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:40,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:49:40,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:49:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:49:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:49:40,736 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-12-02 10:49:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:40,844 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-12-02 10:49:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:49:40,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-02 10:49:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:40,854 INFO L225 Difference]: With dead ends: 6868 [2018-12-02 10:49:40,854 INFO L226 Difference]: Without dead ends: 6670 [2018-12-02 10:49:40,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-02 10:49:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-12-02 10:49:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-12-02 10:49:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-12-02 10:49:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-12-02 10:49:40,936 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-12-02 10:49:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-12-02 10:49:40,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:49:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-12-02 10:49:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 10:49:40,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:40,944 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] [2018-12-02 10:49:40,944 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:40,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash -553267310, now seen corresponding path program 1 times [2018-12-02 10:49:40,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:40,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:40,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:49:41,059 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 10:49:41,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:49:41,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 10:49:41,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:49:41,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:49:41,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:49:41,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:49:41,060 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 10 states. [2018-12-02 10:49:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:49:41,261 INFO L93 Difference]: Finished difference Result 6670 states and 27264 transitions. [2018-12-02 10:49:41,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:49:41,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-02 10:49:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:49:41,271 INFO L225 Difference]: With dead ends: 6670 [2018-12-02 10:49:41,271 INFO L226 Difference]: Without dead ends: 6328 [2018-12-02 10:49:41,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-02 10:49:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6328 states. [2018-12-02 10:49:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6328 to 6328. [2018-12-02 10:49:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6328 states. [2018-12-02 10:49:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 25848 transitions. [2018-12-02 10:49:41,349 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 25848 transitions. Word has length 87 [2018-12-02 10:49:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:49:41,349 INFO L480 AbstractCegarLoop]: Abstraction has 6328 states and 25848 transitions. [2018-12-02 10:49:41,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:49:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 25848 transitions. [2018-12-02 10:49:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 10:49:41,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:49:41,356 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] [2018-12-02 10:49:41,357 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:49:41,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:49:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1100502880, now seen corresponding path program 1 times [2018-12-02 10:49:41,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:49:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:41,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:49:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:49:41,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:49:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:49:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:49:41,393 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 10:49:41,452 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 10:49:41,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:49:41 BasicIcfg [2018-12-02 10:49:41,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 10:49:41,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:49:41,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:49:41,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:49:41,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:48:14" (3/4) ... [2018-12-02 10:49:41,456 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 10:49:41,509 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_faf8cb0e-04bd-49de-8c53-c7326f998072/bin-2019/utaipan/witness.graphml [2018-12-02 10:49:41,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:49:41,510 INFO L168 Benchmark]: Toolchain (without parser) took 87850.54 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 952.4 MB in the beginning and 1.5 GB in the end (delta: -561.0 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-02 10:49:41,510 INFO L168 Benchmark]: CDTParser took 0.11 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 10:49:41,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-02 10:49:41,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.05 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 10:49:41,511 INFO L168 Benchmark]: Boogie Preprocessor took 17.47 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 10:49:41,511 INFO L168 Benchmark]: RCFGBuilder took 228.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2018-12-02 10:49:41,511 INFO L168 Benchmark]: TraceAbstraction took 87107.10 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -479.5 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-12-02 10:49:41,511 INFO L168 Benchmark]: Witness Printer took 55.63 ms. Allocated memory is still 4.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:49:41,512 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -123.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.05 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. * Boogie Preprocessor took 17.47 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 228.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87107.10 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -479.5 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 55.63 ms. Allocated memory is still 4.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1212]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1213] -1 char *v; VAL [v={0:0}] [L1246] -1 pthread_t t; VAL [v={0:0}] [L1247] FCALL, FORK -1 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={96:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={0:0}] [L1232] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={0:0}] [L1216] 1 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1248] -1 \read(t) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1233] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1233] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1234] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 2 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 2 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1236] FCALL, FORK 0 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1237] FCALL, FORK 0 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 4 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 4 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1238] 0 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1238] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1239] 0 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1221] 5 v[0] = 'X' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1222] 5 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1226] 3 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1227] 3 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1239] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1240] 0 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1240] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1241] 0 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1241] FCALL, JOIN 4 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t1={96:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t2={93:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t3={90:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t4={91:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, t5={95:0}, v={92:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1248] FCALL, JOIN 0 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1249] -1 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1212] COND TRUE -1 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] [L1212] -1 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={92:0}, v={92:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 86.9s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 51.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7470 SDtfs, 21852 SDslu, 47937 SDs, 0 SdLazy, 22031 SolverSat, 2938 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 146 SyntacticMatches, 43 SemanticMatches, 966 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5881 ImplicationChecksByTransitivity, 37.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47312occurred in iteration=0, 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: 18.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 282176 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2009 NumberOfCodeBlocks, 2009 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1884 ConstructedInterpolants, 0 QuantifiedInterpolants, 1758192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...