./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --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_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/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 5107685577f81a5867811396b2c0a05eb5630c95 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 17:13:12,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:13:12,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:13:12,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:13:12,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:13:12,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:13:12,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:13:12,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:13:12,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:13:12,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:13:12,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:13:12,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:13:12,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:13:12,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:13:12,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:13:12,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:13:12,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:13:12,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:13:12,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:13:12,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:13:12,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:13:12,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:13:12,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:13:12,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:13:12,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:13:12,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:13:12,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:13:12,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:13:12,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:13:12,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:13:12,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:13:12,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:13:12,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:13:12,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:13:12,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:13:12,363 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:13:12,363 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 17:13:12,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:13:12,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:13:12,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:13:12,371 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:13:12,371 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:13:12,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 17:13:12,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 17:13:12,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:13:12,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:13:12,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 17:13:12,374 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_eeee55d5-7b54-43bc-a03e-e787d469223e/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-12-09 17:13:12,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:13:12,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:13:12,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:13:12,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:13:12,403 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:13:12,404 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 17:13:12,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/data/6348e41b0/e345d01f11fd4e7cae431affa9d0f435/FLAGe0da6bed9 [2018-12-09 17:13:12,869 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:13:12,869 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 17:13:12,875 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/data/6348e41b0/e345d01f11fd4e7cae431affa9d0f435/FLAGe0da6bed9 [2018-12-09 17:13:12,884 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/data/6348e41b0/e345d01f11fd4e7cae431affa9d0f435 [2018-12-09 17:13:12,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:13:12,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:13:12,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:13:12,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:13:12,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:13:12,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:13:12" (1/1) ... [2018-12-09 17:13:12,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:12, skipping insertion in model container [2018-12-09 17:13:12,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:13:12" (1/1) ... [2018-12-09 17:13:12,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:13:12,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:13:13,017 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:13:13,020 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:13:13,037 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:13:13,047 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:13:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13 WrapperNode [2018-12-09 17:13:13,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:13:13,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:13:13,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:13:13,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:13:13,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:13:13,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:13:13,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:13:13,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:13:13,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... [2018-12-09 17:13:13,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:13:13,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:13:13,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:13:13,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:13:13,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:13:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:13:13,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:13:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:13:13,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:13:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:13:13,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:13:13,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:13:13,277 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 17:13:13,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:13:13 BoogieIcfgContainer [2018-12-09 17:13:13,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:13:13,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:13:13,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:13:13,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:13:13,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:13:12" (1/3) ... [2018-12-09 17:13:13,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:13:13, skipping insertion in model container [2018-12-09 17:13:13,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:13:13" (2/3) ... [2018-12-09 17:13:13,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dd541d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:13:13, skipping insertion in model container [2018-12-09 17:13:13,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:13:13" (3/3) ... [2018-12-09 17:13:13,281 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 17:13:13,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:13:13,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 17:13:13,300 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 17:13:13,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:13:13,317 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 17:13:13,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:13:13,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:13:13,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:13:13,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:13:13,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:13:13,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:13:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-09 17:13:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 17:13:13,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:13:13,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-12-09 17:13:13,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,445 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-12-09 17:13:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,470 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-12-09 17:13:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 17:13:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,478 INFO L225 Difference]: With dead ends: 81 [2018-12-09 17:13:13,478 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 17:13:13,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 17:13:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-12-09 17:13:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 17:13:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-12-09 17:13:13,503 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-12-09 17:13:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,503 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-12-09 17:13:13,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-12-09 17:13:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 17:13:13,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:13:13,504 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,504 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-12-09 17:13:13,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,533 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-12-09 17:13:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,546 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-12-09 17:13:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 17:13:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,547 INFO L225 Difference]: With dead ends: 107 [2018-12-09 17:13:13,548 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 17:13:13,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 17:13:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-09 17:13:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 17:13:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-12-09 17:13:13,555 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-12-09 17:13:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,555 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-12-09 17:13:13,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-12-09 17:13:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:13:13,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,556 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] [2018-12-09 17:13:13,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-12-09 17:13:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,591 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-12-09 17:13:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,605 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-12-09 17:13:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 17:13:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,606 INFO L225 Difference]: With dead ends: 99 [2018-12-09 17:13:13,607 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 17:13:13,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 17:13:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-09 17:13:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 17:13:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-12-09 17:13:13,611 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-12-09 17:13:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,611 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-12-09 17:13:13,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-12-09 17:13:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:13:13,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,611 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] [2018-12-09 17:13:13,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-12-09 17:13:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,634 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-12-09 17:13:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,648 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-12-09 17:13:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 17:13:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,649 INFO L225 Difference]: With dead ends: 124 [2018-12-09 17:13:13,649 INFO L226 Difference]: Without dead ends: 122 [2018-12-09 17:13:13,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-09 17:13:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-12-09 17:13:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 17:13:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-12-09 17:13:13,657 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-12-09 17:13:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,657 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-12-09 17:13:13,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-12-09 17:13:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:13:13,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,658 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] [2018-12-09 17:13:13,658 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-12-09 17:13:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,678 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-12-09 17:13:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,691 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-12-09 17:13:13,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 17:13:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,693 INFO L225 Difference]: With dead ends: 204 [2018-12-09 17:13:13,693 INFO L226 Difference]: Without dead ends: 124 [2018-12-09 17:13:13,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-09 17:13:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-09 17:13:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 17:13:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-12-09 17:13:13,701 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-12-09 17:13:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,701 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-12-09 17:13:13,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-12-09 17:13:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:13:13,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:13:13,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-12-09 17:13:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,724 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-12-09 17:13:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,738 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-12-09 17:13:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 17:13:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,739 INFO L225 Difference]: With dead ends: 183 [2018-12-09 17:13:13,739 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 17:13:13,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 17:13:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-09 17:13:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 17:13:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-12-09 17:13:13,746 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-12-09 17:13:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,746 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-12-09 17:13:13,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-12-09 17:13:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:13:13,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,747 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] [2018-12-09 17:13:13,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-12-09 17:13:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,768 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-12-09 17:13:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,783 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-12-09 17:13:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 17:13:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,784 INFO L225 Difference]: With dead ends: 228 [2018-12-09 17:13:13,784 INFO L226 Difference]: Without dead ends: 226 [2018-12-09 17:13:13,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-09 17:13:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-12-09 17:13:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-09 17:13:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-12-09 17:13:13,792 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-12-09 17:13:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-12-09 17:13:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-12-09 17:13:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:13:13,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,793 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] [2018-12-09 17:13:13,793 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-12-09 17:13:13,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,806 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-12-09 17:13:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,819 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-12-09 17:13:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 17:13:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,821 INFO L225 Difference]: With dead ends: 392 [2018-12-09 17:13:13,821 INFO L226 Difference]: Without dead ends: 234 [2018-12-09 17:13:13,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-09 17:13:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-12-09 17:13:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 17:13:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-12-09 17:13:13,827 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-12-09 17:13:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,828 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-12-09 17:13:13,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-12-09 17:13:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:13:13,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,829 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] [2018-12-09 17:13:13,829 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-12-09 17:13:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,846 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-12-09 17:13:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,858 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-12-09 17:13:13,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 17:13:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,859 INFO L225 Difference]: With dead ends: 348 [2018-12-09 17:13:13,859 INFO L226 Difference]: Without dead ends: 238 [2018-12-09 17:13:13,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-09 17:13:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-12-09 17:13:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-09 17:13:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-12-09 17:13:13,867 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-12-09 17:13:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,868 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-12-09 17:13:13,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-12-09 17:13:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:13:13,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,869 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] [2018-12-09 17:13:13,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-12-09 17:13:13,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,883 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-12-09 17:13:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,898 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-12-09 17:13:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 17:13:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,900 INFO L225 Difference]: With dead ends: 428 [2018-12-09 17:13:13,900 INFO L226 Difference]: Without dead ends: 426 [2018-12-09 17:13:13,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-12-09 17:13:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-12-09 17:13:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-09 17:13:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-12-09 17:13:13,906 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-12-09 17:13:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,906 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-12-09 17:13:13,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,906 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-12-09 17:13:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 17:13:13,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,907 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] [2018-12-09 17:13:13,907 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,907 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-12-09 17:13:13,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,919 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-12-09 17:13:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,934 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-12-09 17:13:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 17:13:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,935 INFO L225 Difference]: With dead ends: 764 [2018-12-09 17:13:13,935 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 17:13:13,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 17:13:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-12-09 17:13:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-09 17:13:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-12-09 17:13:13,946 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-12-09 17:13:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,946 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-12-09 17:13:13,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-12-09 17:13:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:13:13,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,947 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] [2018-12-09 17:13:13,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-12-09 17:13:13,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:13,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:13,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:13,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:13,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:13,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:13,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,962 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-12-09 17:13:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:13,974 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-12-09 17:13:13,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:13,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 17:13:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:13,975 INFO L225 Difference]: With dead ends: 672 [2018-12-09 17:13:13,975 INFO L226 Difference]: Without dead ends: 458 [2018-12-09 17:13:13,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-12-09 17:13:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-12-09 17:13:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-09 17:13:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-12-09 17:13:13,984 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-12-09 17:13:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:13,985 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-12-09 17:13:13,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-12-09 17:13:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:13:13,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:13,985 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] [2018-12-09 17:13:13,986 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:13,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-12-09 17:13:13,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:13,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:13,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:13,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,002 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-12-09 17:13:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,023 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-12-09 17:13:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 17:13:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,026 INFO L225 Difference]: With dead ends: 812 [2018-12-09 17:13:14,026 INFO L226 Difference]: Without dead ends: 810 [2018-12-09 17:13:14,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-12-09 17:13:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-12-09 17:13:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-09 17:13:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-12-09 17:13:14,046 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-12-09 17:13:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,047 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-12-09 17:13:14,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-12-09 17:13:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:13:14,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,048 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] [2018-12-09 17:13:14,048 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-12-09 17:13:14,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,063 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-12-09 17:13:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,082 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-12-09 17:13:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 17:13:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,084 INFO L225 Difference]: With dead ends: 1500 [2018-12-09 17:13:14,085 INFO L226 Difference]: Without dead ends: 874 [2018-12-09 17:13:14,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-12-09 17:13:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-12-09 17:13:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-12-09 17:13:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-12-09 17:13:14,103 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-12-09 17:13:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,103 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-12-09 17:13:14,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-12-09 17:13:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 17:13:14,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,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] [2018-12-09 17:13:14,104 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-12-09 17:13:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,118 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-12-09 17:13:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,137 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-12-09 17:13:14,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 17:13:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,139 INFO L225 Difference]: With dead ends: 1308 [2018-12-09 17:13:14,139 INFO L226 Difference]: Without dead ends: 890 [2018-12-09 17:13:14,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-12-09 17:13:14,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-12-09 17:13:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-09 17:13:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-12-09 17:13:14,158 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-12-09 17:13:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-12-09 17:13:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-12-09 17:13:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 17:13:14,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,159 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] [2018-12-09 17:13:14,160 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-12-09 17:13:14,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,175 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-12-09 17:13:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,198 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-12-09 17:13:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 17:13:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,201 INFO L225 Difference]: With dead ends: 1548 [2018-12-09 17:13:14,201 INFO L226 Difference]: Without dead ends: 1546 [2018-12-09 17:13:14,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-09 17:13:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-12-09 17:13:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-12-09 17:13:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-12-09 17:13:14,226 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-12-09 17:13:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,226 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-12-09 17:13:14,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-12-09 17:13:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 17:13:14,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,228 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] [2018-12-09 17:13:14,228 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-12-09 17:13:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,243 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-12-09 17:13:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,273 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-12-09 17:13:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 17:13:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,278 INFO L225 Difference]: With dead ends: 2956 [2018-12-09 17:13:14,278 INFO L226 Difference]: Without dead ends: 1706 [2018-12-09 17:13:14,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-12-09 17:13:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-12-09 17:13:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-12-09 17:13:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-12-09 17:13:14,334 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-12-09 17:13:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,334 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-12-09 17:13:14,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-12-09 17:13:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:13:14,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,336 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] [2018-12-09 17:13:14,336 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-12-09 17:13:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,351 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-12-09 17:13:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,374 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-12-09 17:13:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 17:13:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,377 INFO L225 Difference]: With dead ends: 2556 [2018-12-09 17:13:14,377 INFO L226 Difference]: Without dead ends: 1738 [2018-12-09 17:13:14,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-09 17:13:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-12-09 17:13:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-12-09 17:13:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-12-09 17:13:14,412 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-12-09 17:13:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,412 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-12-09 17:13:14,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-12-09 17:13:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:13:14,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,414 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] [2018-12-09 17:13:14,414 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-12-09 17:13:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,427 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-12-09 17:13:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,488 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-12-09 17:13:14,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 17:13:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,496 INFO L225 Difference]: With dead ends: 2956 [2018-12-09 17:13:14,496 INFO L226 Difference]: Without dead ends: 2954 [2018-12-09 17:13:14,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-09 17:13:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-12-09 17:13:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-12-09 17:13:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-12-09 17:13:14,567 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-12-09 17:13:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,567 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-12-09 17:13:14,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-12-09 17:13:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 17:13:14,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,570 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] [2018-12-09 17:13:14,570 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-12-09 17:13:14,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,583 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-12-09 17:13:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,660 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-12-09 17:13:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 17:13:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,667 INFO L225 Difference]: With dead ends: 5836 [2018-12-09 17:13:14,667 INFO L226 Difference]: Without dead ends: 3338 [2018-12-09 17:13:14,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-09 17:13:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-12-09 17:13:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-12-09 17:13:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-12-09 17:13:14,731 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-12-09 17:13:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,731 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-12-09 17:13:14,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-12-09 17:13:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:13:14,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,734 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] [2018-12-09 17:13:14,734 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-12-09 17:13:14,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,750 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-12-09 17:13:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:14,819 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-12-09 17:13:14,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:14,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 17:13:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:14,825 INFO L225 Difference]: With dead ends: 5004 [2018-12-09 17:13:14,825 INFO L226 Difference]: Without dead ends: 3402 [2018-12-09 17:13:14,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-12-09 17:13:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-12-09 17:13:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-12-09 17:13:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-12-09 17:13:14,889 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-12-09 17:13:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:14,889 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-12-09 17:13:14,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-12-09 17:13:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:13:14,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:14,892 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] [2018-12-09 17:13:14,892 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:14,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-12-09 17:13:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:14,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:14,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:14,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:14,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:14,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:14,903 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-12-09 17:13:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:15,016 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-12-09 17:13:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:15,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 17:13:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:15,027 INFO L225 Difference]: With dead ends: 9804 [2018-12-09 17:13:15,027 INFO L226 Difference]: Without dead ends: 6538 [2018-12-09 17:13:15,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-12-09 17:13:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-12-09 17:13:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-09 17:13:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-12-09 17:13:15,135 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-12-09 17:13:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:15,135 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-12-09 17:13:15,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-12-09 17:13:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:13:15,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:15,139 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] [2018-12-09 17:13:15,139 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:15,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:15,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-12-09 17:13:15,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:15,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:15,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:15,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:15,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:15,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:15,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,155 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-12-09 17:13:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:15,245 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-12-09 17:13:15,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:15,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 17:13:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:15,253 INFO L225 Difference]: With dead ends: 7052 [2018-12-09 17:13:15,253 INFO L226 Difference]: Without dead ends: 7050 [2018-12-09 17:13:15,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-12-09 17:13:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-12-09 17:13:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-12-09 17:13:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-12-09 17:13:15,349 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-12-09 17:13:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:15,349 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-12-09 17:13:15,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-12-09 17:13:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 17:13:15,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:15,353 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] [2018-12-09 17:13:15,353 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:15,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:15,354 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-12-09 17:13:15,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:15,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:15,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:15,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:15,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:15,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,366 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-12-09 17:13:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:15,472 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-12-09 17:13:15,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:15,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 17:13:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:15,496 INFO L225 Difference]: With dead ends: 10634 [2018-12-09 17:13:15,496 INFO L226 Difference]: Without dead ends: 10632 [2018-12-09 17:13:15,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-12-09 17:13:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-12-09 17:13:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-12-09 17:13:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-12-09 17:13:15,605 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-12-09 17:13:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:15,605 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-12-09 17:13:15,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-12-09 17:13:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 17:13:15,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:13:15,612 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] [2018-12-09 17:13:15,612 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 17:13:15,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:13:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-12-09 17:13:15,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:13:15,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:13:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:13:15,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:13:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:13:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:13:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:13:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 17:13:15,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:13:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 17:13:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 17:13:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,620 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-12-09 17:13:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:13:15,756 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-12-09 17:13:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 17:13:15,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 17:13:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:13:15,757 INFO L225 Difference]: With dead ends: 22664 [2018-12-09 17:13:15,757 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 17:13:15,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 17:13:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 17:13:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 17:13:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 17:13:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 17:13:15,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-09 17:13:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:13:15,771 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 17:13:15,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 17:13:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 17:13:15,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 17:13:15,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 17:13:15,785 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 17:13:15,785 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,785 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-09 17:13:15,786 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,787 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-12-09 17:13:15,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:13:15 BoogieIcfgContainer [2018-12-09 17:13:15,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 17:13:15,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 17:13:15,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 17:13:15,791 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 17:13:15,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:13:13" (3/4) ... [2018-12-09 17:13:15,794 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 17:13:15,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 17:13:15,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 17:13:15,802 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 17:13:15,802 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 17:13:15,802 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 17:13:15,835 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eeee55d5-7b54-43bc-a03e-e787d469223e/bin-2019/utaipan/witness.graphml [2018-12-09 17:13:15,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 17:13:15,836 INFO L168 Benchmark]: Toolchain (without parser) took 2949.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 950.8 MB in the beginning and 936.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 182.1 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,837 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:13:15,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:13:15,838 INFO L168 Benchmark]: Boogie Preprocessor took 44.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,838 INFO L168 Benchmark]: RCFGBuilder took 173.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,838 INFO L168 Benchmark]: TraceAbstraction took 2513.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 138.0 MB). Peak memory consumption was 203.0 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,838 INFO L168 Benchmark]: Witness Printer took 44.49 ms. Allocated memory is still 1.2 GB. Free memory was 943.0 MB in the beginning and 936.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 17:13:15,840 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.51 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.53 ms. Allocated memory is still 1.0 GB. Free memory is still 940.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 173.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2513.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 943.0 MB in the end (delta: 138.0 MB). Peak memory consumption was 203.0 MB. Max. memory is 11.5 GB. * Witness Printer took 44.49 ms. Allocated memory is still 1.2 GB. Free memory was 943.0 MB in the beginning and 936.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, 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: 0.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...