./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/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 f2cbbf56a13532141372a32a461d64a9d1351c0e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 06:36:09,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:36:09,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:36:09,504 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:36:09,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:36:09,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:36:09,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:36:09,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:36:09,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:36:09,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:36:09,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:36:09,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:36:09,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:36:09,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:36:09,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:36:09,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:36:09,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:36:09,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:36:09,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:36:09,512 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:36:09,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:36:09,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:36:09,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:36:09,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:36:09,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:36:09,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:36:09,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:36:09,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:36:09,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:36:09,517 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:36:09,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:36:09,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:36:09,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:36:09,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:36:09,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:36:09,518 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:36:09,518 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 06:36:09,525 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:36:09,525 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:36:09,526 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 06:36:09,526 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 06:36:09,526 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 06:36:09,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 06:36:09,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 06:36:09,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:36:09,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:36:09,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 06:36:09,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 06:36:09,529 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 06:36:09,529 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 06:36:09,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 06:36:09,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 06:36:09,529 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_6bb85ffd-f022-4fef-988a-62e323638f81/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-12-09 06:36:09,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:36:09,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:36:09,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:36:09,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:36:09,555 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:36:09,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:36:09,594 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/data/bf3eac7e1/2f99ba412b66438fafeb197e4e882bb9/FLAG1006d1553 [2018-12-09 06:36:09,983 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:36:09,983 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:36:09,987 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/data/bf3eac7e1/2f99ba412b66438fafeb197e4e882bb9/FLAG1006d1553 [2018-12-09 06:36:09,996 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/data/bf3eac7e1/2f99ba412b66438fafeb197e4e882bb9 [2018-12-09 06:36:09,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:36:09,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:36:09,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:36:09,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:36:10,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:36:10,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:36:09" (1/1) ... [2018-12-09 06:36:10,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10, skipping insertion in model container [2018-12-09 06:36:10,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:36:09" (1/1) ... [2018-12-09 06:36:10,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:36:10,025 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:36:10,120 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:36:10,123 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:36:10,137 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:36:10,146 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:36:10,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10 WrapperNode [2018-12-09 06:36:10,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:36:10,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:36:10,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:36:10,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:36:10,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:36:10,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:36:10,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:36:10,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:36:10,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... [2018-12-09 06:36:10,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:36:10,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:36:10,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:36:10,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:36:10,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/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 06:36:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 06:36:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 06:36:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:36:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:36:10,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 06:36:10,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 06:36:10,360 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:36:10,360 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 06:36:10,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:10 BoogieIcfgContainer [2018-12-09 06:36:10,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:36:10,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 06:36:10,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 06:36:10,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 06:36:10,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:36:09" (1/3) ... [2018-12-09 06:36:10,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da5f710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:36:10, skipping insertion in model container [2018-12-09 06:36:10,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:36:10" (2/3) ... [2018-12-09 06:36:10,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da5f710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:36:10, skipping insertion in model container [2018-12-09 06:36:10,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:10" (3/3) ... [2018-12-09 06:36:10,364 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:36:10,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 06:36:10,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 06:36:10,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 06:36:10,399 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 06:36:10,399 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 06:36:10,399 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 06:36:10,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:36:10,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:36:10,400 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 06:36:10,400 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:36:10,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 06:36:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-09 06:36:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 06:36:10,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-12-09 06:36:10,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,509 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 06:36:10,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,522 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-09 06:36:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,547 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-12-09 06:36:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 06:36:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,554 INFO L225 Difference]: With dead ends: 75 [2018-12-09 06:36:10,555 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 06:36:10,556 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 06:36:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 06:36:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-12-09 06:36:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 06:36:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-12-09 06:36:10,580 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-12-09 06:36:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,580 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-12-09 06:36:10,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-12-09 06:36:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 06:36:10,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-12-09 06:36:10,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,604 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 06:36:10,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,605 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-12-09 06:36:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,621 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-12-09 06:36:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 06:36:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,622 INFO L225 Difference]: With dead ends: 97 [2018-12-09 06:36:10,622 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 06:36:10,623 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 06:36:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 06:36:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-12-09 06:36:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 06:36:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-12-09 06:36:10,627 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-12-09 06:36:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,627 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-12-09 06:36:10,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-12-09 06:36:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:36:10,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,628 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 06:36:10,628 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-12-09 06:36:10,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,655 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 06:36:10,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,656 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-12-09 06:36:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,671 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-12-09 06:36:10,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:36:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,672 INFO L225 Difference]: With dead ends: 90 [2018-12-09 06:36:10,672 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 06:36:10,673 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 06:36:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 06:36:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-09 06:36:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 06:36:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-12-09 06:36:10,678 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-12-09 06:36:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,679 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-12-09 06:36:10,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-12-09 06:36:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:36:10,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,680 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-12-09 06:36:10,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:36:10,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,710 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-12-09 06:36:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,721 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-12-09 06:36:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:36:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,722 INFO L225 Difference]: With dead ends: 112 [2018-12-09 06:36:10,722 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 06:36:10,722 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 06:36:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 06:36:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-12-09 06:36:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 06:36:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-12-09 06:36:10,727 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-12-09 06:36:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,727 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-12-09 06:36:10,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-12-09 06:36:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:36:10,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,727 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 06:36:10,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-12-09 06:36:10,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,742 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 06:36:10,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,743 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-12-09 06:36:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,752 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-12-09 06:36:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:36:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,753 INFO L225 Difference]: With dead ends: 184 [2018-12-09 06:36:10,753 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 06:36:10,754 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 06:36:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 06:36:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-12-09 06:36:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 06:36:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-12-09 06:36:10,759 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-12-09 06:36:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,759 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-12-09 06:36:10,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-12-09 06:36:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:36:10,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,759 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 06:36:10,759 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,760 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-12-09 06:36:10,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,772 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 06:36:10,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,773 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-12-09 06:36:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,784 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-12-09 06:36:10,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:36:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,785 INFO L225 Difference]: With dead ends: 165 [2018-12-09 06:36:10,785 INFO L226 Difference]: Without dead ends: 114 [2018-12-09 06:36:10,786 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 06:36:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-09 06:36:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-09 06:36:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 06:36:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-12-09 06:36:10,792 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-12-09 06:36:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,792 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-12-09 06:36:10,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-12-09 06:36:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:36:10,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,792 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 06:36:10,792 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-12-09 06:36:10,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:36:10,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,819 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-12-09 06:36:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,833 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-12-09 06:36:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:36:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,834 INFO L225 Difference]: With dead ends: 204 [2018-12-09 06:36:10,834 INFO L226 Difference]: Without dead ends: 202 [2018-12-09 06:36:10,834 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 06:36:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-09 06:36:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-12-09 06:36:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 06:36:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-12-09 06:36:10,840 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-12-09 06:36:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,840 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-12-09 06:36:10,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-12-09 06:36:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:36:10,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,841 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 06:36:10,841 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-12-09 06:36:10,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,857 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 06:36:10,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,858 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-12-09 06:36:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,871 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-12-09 06:36:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:36:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,872 INFO L225 Difference]: With dead ends: 352 [2018-12-09 06:36:10,873 INFO L226 Difference]: Without dead ends: 210 [2018-12-09 06:36:10,873 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 06:36:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-09 06:36:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-12-09 06:36:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-09 06:36:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-12-09 06:36:10,881 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-12-09 06:36:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,881 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-12-09 06:36:10,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-12-09 06:36:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:36:10,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,882 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 06:36:10,882 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,883 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-12-09 06:36:10,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,895 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 06:36:10,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,896 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-12-09 06:36:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,906 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-12-09 06:36:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:36:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,907 INFO L225 Difference]: With dead ends: 312 [2018-12-09 06:36:10,907 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 06:36:10,907 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 06:36:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 06:36:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-12-09 06:36:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-09 06:36:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-12-09 06:36:10,914 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-12-09 06:36:10,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,914 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-12-09 06:36:10,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-12-09 06:36:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:36:10,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-12-09 06:36:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,933 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 06:36:10,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,934 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-12-09 06:36:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,948 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-12-09 06:36:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:36:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,950 INFO L225 Difference]: With dead ends: 380 [2018-12-09 06:36:10,950 INFO L226 Difference]: Without dead ends: 378 [2018-12-09 06:36:10,950 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 06:36:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-09 06:36:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-12-09 06:36:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-09 06:36:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-12-09 06:36:10,958 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-12-09 06:36:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,959 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-12-09 06:36:10,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-12-09 06:36:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:36:10,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,960 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,960 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-12-09 06:36:10,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:10,974 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 06:36:10,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:10,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:10,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:10,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:10,975 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-12-09 06:36:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:10,989 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-12-09 06:36:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:10,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:36:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:10,990 INFO L225 Difference]: With dead ends: 684 [2018-12-09 06:36:10,990 INFO L226 Difference]: Without dead ends: 402 [2018-12-09 06:36:10,991 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 06:36:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-09 06:36:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-12-09 06:36:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-09 06:36:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-12-09 06:36:10,997 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-12-09 06:36:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:10,998 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-12-09 06:36:10,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-12-09 06:36:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 06:36:10,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:10,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:36:10,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:10,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-12-09 06:36:10,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:10,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,014 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 06:36:11,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,015 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-12-09 06:36:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,033 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-12-09 06:36:11,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 06:36:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,035 INFO L225 Difference]: With dead ends: 600 [2018-12-09 06:36:11,035 INFO L226 Difference]: Without dead ends: 410 [2018-12-09 06:36:11,036 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 06:36:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-09 06:36:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-12-09 06:36:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-09 06:36:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-12-09 06:36:11,049 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-12-09 06:36:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-12-09 06:36:11,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-12-09 06:36:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 06:36:11,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,051 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 06:36:11,051 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-12-09 06:36:11,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,065 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 06:36:11,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,067 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-12-09 06:36:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,086 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-12-09 06:36:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 06:36:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,088 INFO L225 Difference]: With dead ends: 716 [2018-12-09 06:36:11,088 INFO L226 Difference]: Without dead ends: 714 [2018-12-09 06:36:11,089 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 06:36:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-09 06:36:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-12-09 06:36:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-12-09 06:36:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-12-09 06:36:11,107 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-12-09 06:36:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,107 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-12-09 06:36:11,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-12-09 06:36:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 06:36:11,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,109 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 06:36:11,109 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-12-09 06:36:11,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,119 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 06:36:11,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,120 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-12-09 06:36:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,148 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-12-09 06:36:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 06:36:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,151 INFO L225 Difference]: With dead ends: 1340 [2018-12-09 06:36:11,151 INFO L226 Difference]: Without dead ends: 778 [2018-12-09 06:36:11,152 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 06:36:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-12-09 06:36:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-12-09 06:36:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-09 06:36:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-12-09 06:36:11,170 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-12-09 06:36:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,170 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-12-09 06:36:11,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-12-09 06:36:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 06:36:11,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,171 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 06:36:11,171 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-12-09 06:36:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,180 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 06:36:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,181 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-12-09 06:36:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,206 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-12-09 06:36:11,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 06:36:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,208 INFO L225 Difference]: With dead ends: 1164 [2018-12-09 06:36:11,209 INFO L226 Difference]: Without dead ends: 794 [2018-12-09 06:36:11,209 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 06:36:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-12-09 06:36:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-12-09 06:36:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-09 06:36:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-12-09 06:36:11,235 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-12-09 06:36:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,235 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-12-09 06:36:11,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-12-09 06:36:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 06:36:11,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,237 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 06:36:11,237 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-12-09 06:36:11,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,250 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 06:36:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,251 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-12-09 06:36:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,283 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-12-09 06:36:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 06:36:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,286 INFO L225 Difference]: With dead ends: 1356 [2018-12-09 06:36:11,286 INFO L226 Difference]: Without dead ends: 1354 [2018-12-09 06:36:11,287 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 06:36:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-09 06:36:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-12-09 06:36:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-09 06:36:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-12-09 06:36:11,309 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-12-09 06:36:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-12-09 06:36:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-12-09 06:36:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 06:36:11,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,311 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 06:36:11,311 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-12-09 06:36:11,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,322 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 06:36:11,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,323 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-12-09 06:36:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,373 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-12-09 06:36:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 06:36:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,377 INFO L225 Difference]: With dead ends: 2636 [2018-12-09 06:36:11,377 INFO L226 Difference]: Without dead ends: 1514 [2018-12-09 06:36:11,379 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 06:36:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-12-09 06:36:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-12-09 06:36:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-12-09 06:36:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-12-09 06:36:11,419 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-12-09 06:36:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,419 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-12-09 06:36:11,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-12-09 06:36:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 06:36:11,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,421 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 06:36:11,421 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-12-09 06:36:11,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,442 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 06:36:11,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,443 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-12-09 06:36:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,482 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-12-09 06:36:11,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 06:36:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,487 INFO L225 Difference]: With dead ends: 2268 [2018-12-09 06:36:11,487 INFO L226 Difference]: Without dead ends: 1546 [2018-12-09 06:36:11,488 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 06:36:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-09 06:36:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-12-09 06:36:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-09 06:36:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-12-09 06:36:11,533 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-12-09 06:36:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,533 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-12-09 06:36:11,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-12-09 06:36:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 06:36:11,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,535 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 06:36:11,535 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-12-09 06:36:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,549 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 06:36:11,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,550 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-12-09 06:36:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,595 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-12-09 06:36:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 06:36:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,599 INFO L225 Difference]: With dead ends: 2572 [2018-12-09 06:36:11,599 INFO L226 Difference]: Without dead ends: 2570 [2018-12-09 06:36:11,600 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 06:36:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-12-09 06:36:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-12-09 06:36:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-09 06:36:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-12-09 06:36:11,639 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-12-09 06:36:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,640 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-12-09 06:36:11,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-12-09 06:36:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 06:36:11,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,641 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 06:36:11,641 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-12-09 06:36:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,653 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 06:36:11,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,654 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-12-09 06:36:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,712 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-12-09 06:36:11,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 06:36:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,717 INFO L225 Difference]: With dead ends: 5196 [2018-12-09 06:36:11,717 INFO L226 Difference]: Without dead ends: 2954 [2018-12-09 06:36:11,720 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 06:36:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-09 06:36:11,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-12-09 06:36:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-12-09 06:36:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-12-09 06:36:11,779 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-12-09 06:36:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,779 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-12-09 06:36:11,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-12-09 06:36:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 06:36:11,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,781 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 06:36:11,782 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-12-09 06:36:11,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,790 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 06:36:11,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,791 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-12-09 06:36:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:11,838 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-12-09 06:36:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:11,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 06:36:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:11,844 INFO L225 Difference]: With dead ends: 4428 [2018-12-09 06:36:11,844 INFO L226 Difference]: Without dead ends: 3018 [2018-12-09 06:36:11,846 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 06:36:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-12-09 06:36:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-12-09 06:36:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-09 06:36:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-12-09 06:36:11,904 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-12-09 06:36:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:11,904 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-12-09 06:36:11,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-12-09 06:36:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 06:36:11,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:11,906 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 06:36:11,907 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:11,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:11,907 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-12-09 06:36:11,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:11,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:11,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:11,916 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 06:36:11,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:11,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:11,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:11,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:11,917 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-12-09 06:36:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:12,006 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-12-09 06:36:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:12,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 06:36:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:12,012 INFO L225 Difference]: With dead ends: 8650 [2018-12-09 06:36:12,012 INFO L226 Difference]: Without dead ends: 3016 [2018-12-09 06:36:12,017 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 06:36:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-12-09 06:36:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-12-09 06:36:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-09 06:36:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-12-09 06:36:12,083 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-12-09 06:36:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:12,083 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-12-09 06:36:12,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-12-09 06:36:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 06:36:12,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:36:12,086 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 06:36:12,086 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:36:12,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:36:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-12-09 06:36:12,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 06:36:12,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:12,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:36:12,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:36:12,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 06:36:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:36:12,095 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 06:36:12,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:36:12,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:36:12,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 06:36:12,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:36:12,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:36:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:36:12,096 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-12-09 06:36:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:36:12,139 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-12-09 06:36:12,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:36:12,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 06:36:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:36:12,140 INFO L225 Difference]: With dead ends: 3016 [2018-12-09 06:36:12,140 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 06:36:12,142 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 06:36:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 06:36:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 06:36:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 06:36:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 06:36:12,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-09 06:36:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:36:12,143 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:36:12,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:36:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:36:12,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 06:36:12,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 06:36:12,157 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 06:36:12,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 06:36:12,157 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 06:36:12,158 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,158 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,159 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-12-09 06:36:12,160 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-12-09 06:36:12,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:36:12 BoogieIcfgContainer [2018-12-09 06:36:12,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 06:36:12,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:36:12,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:36:12,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:36:12,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:36:10" (3/4) ... [2018-12-09 06:36:12,170 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 06:36:12,174 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 06:36:12,175 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 06:36:12,178 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 06:36:12,178 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 06:36:12,178 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 06:36:12,210 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6bb85ffd-f022-4fef-988a-62e323638f81/bin-2019/utaipan/witness.graphml [2018-12-09 06:36:12,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:36:12,210 INFO L168 Benchmark]: Toolchain (without parser) took 2212.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,211 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:36:12,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.27 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:36:12,212 INFO L168 Benchmark]: Boogie Preprocessor took 44.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,212 INFO L168 Benchmark]: RCFGBuilder took 157.19 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,212 INFO L168 Benchmark]: TraceAbstraction took 1804.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,213 INFO L168 Benchmark]: Witness Printer took 43.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:36:12,214 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.19 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 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 12.27 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.19 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1804.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * Witness Printer took 43.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...