./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/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_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/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-aa41828 [2018-11-23 00:21:15,294 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:21:15,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:21:15,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:21:15,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:21:15,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:21:15,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:21:15,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:21:15,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:21:15,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:21:15,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:21:15,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:21:15,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:21:15,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:21:15,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:21:15,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:21:15,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:21:15,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:21:15,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:21:15,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:21:15,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:21:15,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:21:15,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:21:15,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:21:15,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:21:15,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:21:15,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:21:15,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:21:15,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:21:15,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:21:15,322 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:21:15,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:21:15,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:21:15,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:21:15,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:21:15,324 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:21:15,324 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 00:21:15,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:21:15,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:21:15,335 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:21:15,335 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:21:15,335 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 00:21:15,335 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 00:21:15,336 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 00:21:15,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:21:15,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:21:15,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:21:15,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:21:15,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:21:15,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:21:15,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 00:21:15,340 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_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/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-11-23 00:21:15,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:21:15,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:21:15,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:21:15,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:21:15,372 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:21:15,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 00:21:15,406 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/data/a2aa803c0/d25013d262c9450aad9a47e26cee6bea/FLAGfc1fa9adc [2018-11-23 00:21:15,797 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:21:15,797 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 00:21:15,801 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/data/a2aa803c0/d25013d262c9450aad9a47e26cee6bea/FLAGfc1fa9adc [2018-11-23 00:21:15,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/data/a2aa803c0/d25013d262c9450aad9a47e26cee6bea [2018-11-23 00:21:15,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:21:15,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:21:15,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:21:15,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:21:15,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:21:15,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5701f892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15, skipping insertion in model container [2018-11-23 00:21:15,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:21:15,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:21:15,946 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:21:15,948 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:21:15,962 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:21:15,969 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:21:15,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15 WrapperNode [2018-11-23 00:21:15,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:21:15,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:21:15,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:21:15,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:21:15,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:21:15,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:21:15,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:21:15,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:21:15,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:15,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:16,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:16,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... [2018-11-23 00:21:16,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:21:16,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:21:16,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:21:16,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:21:16,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/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-11-23 00:21:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:21:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:21:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:21:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:21:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:21:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:21:16,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:21:16,277 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:21:16,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:16 BoogieIcfgContainer [2018-11-23 00:21:16,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:21:16,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:21:16,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:21:16,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:21:16,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:15" (1/3) ... [2018-11-23 00:21:16,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760fec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:16, skipping insertion in model container [2018-11-23 00:21:16,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:15" (2/3) ... [2018-11-23 00:21:16,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760fec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:16, skipping insertion in model container [2018-11-23 00:21:16,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:16" (3/3) ... [2018-11-23 00:21:16,283 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 00:21:16,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:21:16,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:21:16,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:21:16,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:21:16,338 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:21:16,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:21:16,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:21:16,339 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:21:16,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:21:16,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:21:16,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:21:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 00:21:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:21:16,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:16,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,365 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-11-23 00:21:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,508 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-23 00:21:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,543 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-11-23 00:21:16,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 00:21:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,552 INFO L225 Difference]: With dead ends: 75 [2018-11-23 00:21:16,552 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 00:21:16,554 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-11-23 00:21:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 00:21:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 00:21:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 00:21:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-11-23 00:21:16,579 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-11-23 00:21:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,580 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-11-23 00:21:16,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-11-23 00:21:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:21:16,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,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-11-23 00:21:16,581 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-11-23 00:21:16,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,613 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-11-23 00:21:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,635 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-11-23 00:21:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 00:21:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,636 INFO L225 Difference]: With dead ends: 97 [2018-11-23 00:21:16,636 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 00:21:16,637 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-11-23 00:21:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 00:21:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 00:21:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 00:21:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-11-23 00:21:16,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-11-23 00:21:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,642 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-11-23 00:21:16,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-11-23 00:21:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:21:16,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,642 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-11-23 00:21:16,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-11-23 00:21:16,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,675 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-11-23 00:21:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,698 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-23 00:21:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 00:21:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,700 INFO L225 Difference]: With dead ends: 90 [2018-11-23 00:21:16,700 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 00:21:16,700 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-11-23 00:21:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 00:21:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 00:21:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 00:21:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-11-23 00:21:16,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-11-23 00:21:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,707 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-11-23 00:21:16,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-11-23 00:21:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:21:16,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,707 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-11-23 00:21:16,708 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-11-23 00:21:16,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,740 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-11-23 00:21:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,757 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-11-23 00:21:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 00:21:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,758 INFO L225 Difference]: With dead ends: 112 [2018-11-23 00:21:16,758 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 00:21:16,759 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-11-23 00:21:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 00:21:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-11-23 00:21:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 00:21:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-11-23 00:21:16,764 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-11-23 00:21:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,764 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-11-23 00:21:16,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-11-23 00:21:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:21:16,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,765 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-11-23 00:21:16,765 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-11-23 00:21:16,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,783 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-11-23 00:21:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,805 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-11-23 00:21:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 00:21:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,806 INFO L225 Difference]: With dead ends: 184 [2018-11-23 00:21:16,806 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 00:21:16,807 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-11-23 00:21:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 00:21:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 00:21:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 00:21:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-11-23 00:21:16,814 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-11-23 00:21:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,815 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-11-23 00:21:16,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-11-23 00:21:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:21:16,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,816 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-11-23 00:21:16,816 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-11-23 00:21:16,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,845 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-11-23 00:21:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,855 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-11-23 00:21:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 00:21:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,856 INFO L225 Difference]: With dead ends: 165 [2018-11-23 00:21:16,856 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 00:21:16,857 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-11-23 00:21:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 00:21:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 00:21:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 00:21:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-11-23 00:21:16,864 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-11-23 00:21:16,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,864 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-11-23 00:21:16,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-11-23 00:21:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:21:16,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,865 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-11-23 00:21:16,865 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-11-23 00:21:16,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,893 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-11-23 00:21:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,908 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-11-23 00:21:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 00:21:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,909 INFO L225 Difference]: With dead ends: 204 [2018-11-23 00:21:16,909 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 00:21:16,909 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-11-23 00:21:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 00:21:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-11-23 00:21:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 00:21:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-11-23 00:21:16,918 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-11-23 00:21:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,918 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-11-23 00:21:16,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-11-23 00:21:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 00:21:16,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,919 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-11-23 00:21:16,919 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-11-23 00:21:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:16,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:16,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:16,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:16,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:16,948 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-11-23 00:21:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:16,971 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-11-23 00:21:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:16,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 00:21:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:16,973 INFO L225 Difference]: With dead ends: 352 [2018-11-23 00:21:16,973 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 00:21:16,973 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-11-23 00:21:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 00:21:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-23 00:21:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 00:21:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-11-23 00:21:16,983 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-11-23 00:21:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:16,984 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-11-23 00:21:16,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-11-23 00:21:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:21:16,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:16,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:16,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:16,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-11-23 00:21:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:16,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:16,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,004 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-11-23 00:21:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,026 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 00:21:17,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 00:21:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,027 INFO L225 Difference]: With dead ends: 312 [2018-11-23 00:21:17,027 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 00:21:17,028 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-11-23 00:21:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 00:21:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-23 00:21:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 00:21:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-11-23 00:21:17,037 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-11-23 00:21:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,037 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-11-23 00:21:17,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-11-23 00:21:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:21:17,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,038 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-11-23 00:21:17,038 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-11-23 00:21:17,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,068 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-11-23 00:21:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,087 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-11-23 00:21:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 00:21:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,089 INFO L225 Difference]: With dead ends: 380 [2018-11-23 00:21:17,089 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 00:21:17,090 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-11-23 00:21:17,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 00:21:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-11-23 00:21:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-23 00:21:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-11-23 00:21:17,096 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-11-23 00:21:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,096 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-11-23 00:21:17,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-11-23 00:21:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 00:21:17,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,097 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-11-23 00:21:17,097 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-11-23 00:21:17,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,113 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-11-23 00:21:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,125 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-11-23 00:21:17,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 00:21:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,128 INFO L225 Difference]: With dead ends: 684 [2018-11-23 00:21:17,128 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 00:21:17,129 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-11-23 00:21:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 00:21:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-11-23 00:21:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 00:21:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-11-23 00:21:17,141 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-11-23 00:21:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,141 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-11-23 00:21:17,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-11-23 00:21:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:21:17,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:17,142 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-11-23 00:21:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,172 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-11-23 00:21:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,189 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-11-23 00:21:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 00:21:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,192 INFO L225 Difference]: With dead ends: 600 [2018-11-23 00:21:17,192 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 00:21:17,193 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-11-23 00:21:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 00:21:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-11-23 00:21:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-23 00:21:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-11-23 00:21:17,207 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-11-23 00:21:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,207 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-11-23 00:21:17,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-11-23 00:21:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:21:17,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:17,209 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-11-23 00:21:17,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,227 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-11-23 00:21:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,260 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-11-23 00:21:17,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 00:21:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,263 INFO L225 Difference]: With dead ends: 716 [2018-11-23 00:21:17,263 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 00:21:17,264 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-11-23 00:21:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 00:21:17,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-11-23 00:21:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 00:21:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-11-23 00:21:17,282 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-11-23 00:21:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,283 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-11-23 00:21:17,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-11-23 00:21:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:21:17,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,284 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-11-23 00:21:17,284 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,285 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-11-23 00:21:17,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,300 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-11-23 00:21:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,329 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-11-23 00:21:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 00:21:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,332 INFO L225 Difference]: With dead ends: 1340 [2018-11-23 00:21:17,332 INFO L226 Difference]: Without dead ends: 778 [2018-11-23 00:21:17,333 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-11-23 00:21:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-23 00:21:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-11-23 00:21:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 00:21:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-11-23 00:21:17,358 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-11-23 00:21:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,359 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-11-23 00:21:17,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-11-23 00:21:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:21:17,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,360 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-11-23 00:21:17,360 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-11-23 00:21:17,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,375 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-11-23 00:21:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,413 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-11-23 00:21:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 00:21:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,416 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 00:21:17,416 INFO L226 Difference]: Without dead ends: 794 [2018-11-23 00:21:17,417 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-11-23 00:21:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-23 00:21:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-23 00:21:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 00:21:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-11-23 00:21:17,444 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-11-23 00:21:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,444 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-11-23 00:21:17,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-11-23 00:21:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:21:17,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,445 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-11-23 00:21:17,446 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-11-23 00:21:17,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,472 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-11-23 00:21:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,506 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-11-23 00:21:17,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 00:21:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,511 INFO L225 Difference]: With dead ends: 1356 [2018-11-23 00:21:17,511 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 00:21:17,512 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-11-23 00:21:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 00:21:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-11-23 00:21:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 00:21:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-11-23 00:21:17,548 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-11-23 00:21:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,548 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-11-23 00:21:17,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-11-23 00:21:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 00:21:17,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,550 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-11-23 00:21:17,550 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-11-23 00:21:17,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,570 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-11-23 00:21:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,615 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-11-23 00:21:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 00:21:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,619 INFO L225 Difference]: With dead ends: 2636 [2018-11-23 00:21:17,619 INFO L226 Difference]: Without dead ends: 1514 [2018-11-23 00:21:17,621 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-11-23 00:21:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-11-23 00:21:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-11-23 00:21:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-11-23 00:21:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-11-23 00:21:17,673 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-11-23 00:21:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,673 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-11-23 00:21:17,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-11-23 00:21:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:21:17,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,675 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-11-23 00:21:17,675 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-11-23 00:21:17,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,688 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-11-23 00:21:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,741 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-11-23 00:21:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 00:21:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,746 INFO L225 Difference]: With dead ends: 2268 [2018-11-23 00:21:17,746 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 00:21:17,747 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-11-23 00:21:17,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 00:21:17,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-11-23 00:21:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 00:21:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-11-23 00:21:17,791 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-11-23 00:21:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,792 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-11-23 00:21:17,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-11-23 00:21:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:21:17,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:21:17,794 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-11-23 00:21:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,808 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-11-23 00:21:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:17,873 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-11-23 00:21:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:17,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 00:21:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:17,880 INFO L225 Difference]: With dead ends: 2572 [2018-11-23 00:21:17,880 INFO L226 Difference]: Without dead ends: 2570 [2018-11-23 00:21:17,881 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-11-23 00:21:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-11-23 00:21:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-11-23 00:21:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 00:21:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-11-23 00:21:17,938 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-11-23 00:21:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:17,939 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-11-23 00:21:17,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-11-23 00:21:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 00:21:17,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:17,941 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-11-23 00:21:17,942 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:17,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:17,942 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-11-23 00:21:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:17,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:17,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:17,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:17,957 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-11-23 00:21:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:18,032 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-11-23 00:21:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:18,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 00:21:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:18,039 INFO L225 Difference]: With dead ends: 5196 [2018-11-23 00:21:18,039 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 00:21:18,042 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-11-23 00:21:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 00:21:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-11-23 00:21:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-23 00:21:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-11-23 00:21:18,129 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-11-23 00:21:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-11-23 00:21:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-11-23 00:21:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:21:18,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:18,132 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-11-23 00:21:18,133 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:18,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-11-23 00:21:18,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:18,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:18,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:18,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:18,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:18,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:18,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:18,150 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-11-23 00:21:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:18,221 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-11-23 00:21:18,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:18,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 00:21:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:18,227 INFO L225 Difference]: With dead ends: 4428 [2018-11-23 00:21:18,227 INFO L226 Difference]: Without dead ends: 3018 [2018-11-23 00:21:18,229 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-11-23 00:21:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-11-23 00:21:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-11-23 00:21:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 00:21:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-11-23 00:21:18,314 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-11-23 00:21:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:18,314 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-11-23 00:21:18,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-11-23 00:21:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:21:18,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:18,317 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-11-23 00:21:18,317 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:18,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-11-23 00:21:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:18,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:18,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:18,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:18,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:18,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:18,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:18,334 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-11-23 00:21:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:18,441 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-11-23 00:21:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:18,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 00:21:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:18,448 INFO L225 Difference]: With dead ends: 8650 [2018-11-23 00:21:18,449 INFO L226 Difference]: Without dead ends: 3016 [2018-11-23 00:21:18,455 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-11-23 00:21:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-11-23 00:21:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-11-23 00:21:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 00:21:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-11-23 00:21:18,545 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-11-23 00:21:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:18,545 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-11-23 00:21:18,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 00:21:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:21:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:21:18,548 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-11-23 00:21:18,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:21:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:21:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-11-23 00:21:18,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 00:21:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:21:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:21:18,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 00:21:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:21:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:21:18,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:21:18,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:21:18,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 00:21:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:21:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:21:18,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:21:18,580 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-11-23 00:21:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:21:18,628 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 00:21:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:21:18,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 00:21:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:21:18,630 INFO L225 Difference]: With dead ends: 3016 [2018-11-23 00:21:18,630 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:21:18,634 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-11-23 00:21:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:21:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:21:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:21:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:21:18,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 00:21:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:21:18,635 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:21:18,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:21:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:21:18,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:21:18,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:21:18,657 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 00:21:18,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:21:18,657 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:21:18,657 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 00:21:18,658 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 00:21:18,658 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 00:21:18,659 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-23 00:21:18,660 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 00:21:18,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:21:18 BoogieIcfgContainer [2018-11-23 00:21:18,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:21:18,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:21:18,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:21:18,666 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:21:18,666 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:16" (3/4) ... [2018-11-23 00:21:18,669 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:21:18,674 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:21:18,675 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:21:18,678 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 00:21:18,679 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 00:21:18,679 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:21:18,720 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e306d20b-70e1-4fdc-ac8d-fdc33355a7a0/bin-2019/utaipan/witness.graphml [2018-11-23 00:21:18,720 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:21:18,721 INFO L168 Benchmark]: Toolchain (without parser) took 2907.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:18,722 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:21:18,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:18,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:21:18,723 INFO L168 Benchmark]: Boogie Preprocessor took 19.50 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:21:18,723 INFO L168 Benchmark]: RCFGBuilder took 270.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:18,723 INFO L168 Benchmark]: TraceAbstraction took 2387.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:18,725 INFO L168 Benchmark]: Witness Printer took 55.04 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:21:18,726 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 16.57 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.50 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 270.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2387.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.04 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: 5.2 MB). Peak memory consumption was 5.2 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, 2.3s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.9s 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.2s 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.6s 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.1s SatisfiabilityAnalysisTime, 0.3s 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...