./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:20:10,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:20:10,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:20:10,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:20:10,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:20:10,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:20:10,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:20:10,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:20:10,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:20:10,803 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:20:10,804 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:20:10,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:20:10,805 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:20:10,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:20:10,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:20:10,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:20:10,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:20:10,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:20:10,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:20:10,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:20:10,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:20:10,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:20:10,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:20:10,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:20:10,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:20:10,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:20:10,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:20:10,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:20:10,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:20:10,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:20:10,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:20:10,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:20:10,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:20:10,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:20:10,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:20:10,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:20:10,823 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 12:20:10,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:20:10,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:20:10,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:20:10,834 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:20:10,834 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:20:10,834 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:20:10,834 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:20:10,835 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:20:10,835 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:20:10,835 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:20:10,835 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:20:10,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:20:10,836 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:20:10,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:20:10,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:20:10,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:20:10,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:20:10,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:20:10,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:20:10,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:20:10,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:20:10,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:20:10,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:20:10,840 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:20:10,841 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_ce707d69-a165-47b3-add8-754800bdbebb/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-10 12:20:10,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:20:10,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:20:10,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:20:10,877 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:20:10,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:20:10,878 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:20:10,922 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/data/3c8594bbd/f72f13a2bfef455da2bc22ca46839bb6/FLAG4b8004bad [2018-11-10 12:20:11,315 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:20:11,316 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:20:11,320 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/data/3c8594bbd/f72f13a2bfef455da2bc22ca46839bb6/FLAG4b8004bad [2018-11-10 12:20:11,329 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/data/3c8594bbd/f72f13a2bfef455da2bc22ca46839bb6 [2018-11-10 12:20:11,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:20:11,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:20:11,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:11,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:20:11,335 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:20:11,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11, skipping insertion in model container [2018-11-10 12:20:11,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:20:11,357 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:20:11,462 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:11,464 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:20:11,480 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:20:11,488 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:20:11,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11 WrapperNode [2018-11-10 12:20:11,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:20:11,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:20:11,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:20:11,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:20:11,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:20:11,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:20:11,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:20:11,502 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:20:11,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... [2018-11-10 12:20:11,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:20:11,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:20:11,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:20:11,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:20:11,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/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-10 12:20:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:20:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:20:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:20:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:20:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:20:11,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:20:11,792 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:20:11,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:11 BoogieIcfgContainer [2018-11-10 12:20:11,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:20:11,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:20:11,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:20:11,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:20:11,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:20:11" (1/3) ... [2018-11-10 12:20:11,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fffdd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:11, skipping insertion in model container [2018-11-10 12:20:11,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:20:11" (2/3) ... [2018-11-10 12:20:11,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fffdd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:20:11, skipping insertion in model container [2018-11-10 12:20:11,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:11" (3/3) ... [2018-11-10 12:20:11,799 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 12:20:11,808 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:20:11,812 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:20:11,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:20:11,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:20:11,851 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:20:11,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:20:11,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:20:11,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:20:11,851 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:20:11,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:20:11,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:20:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-10 12:20:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:20:11,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:11,873 INFO L375 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-10 12:20:11,875 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:11,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1514281487, now seen corresponding path program 1 times [2018-11-10 12:20:11,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:11,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:11,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:11,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:12,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,016 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,031 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-11-10 12:20:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,075 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2018-11-10 12:20:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:20:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,085 INFO L225 Difference]: With dead ends: 95 [2018-11-10 12:20:12,086 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 12:20:12,088 INFO L605 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-10 12:20:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 12:20:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2018-11-10 12:20:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 12:20:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2018-11-10 12:20:12,116 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2018-11-10 12:20:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,116 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2018-11-10 12:20:12,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2018-11-10 12:20:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 12:20:12,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,117 INFO L375 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-10 12:20:12,117 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash 503164237, now seen corresponding path program 1 times [2018-11-10 12:20:12,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,157 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-10 12:20:12,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,157 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,159 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand 3 states. [2018-11-10 12:20:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,197 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2018-11-10 12:20:12,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 12:20:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,199 INFO L225 Difference]: With dead ends: 130 [2018-11-10 12:20:12,199 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 12:20:12,200 INFO L605 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-10 12:20:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 12:20:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-10 12:20:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 12:20:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-11-10 12:20:12,208 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 22 [2018-11-10 12:20:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,209 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2018-11-10 12:20:12,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-11-10 12:20:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:20:12,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,209 INFO L375 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-10 12:20:12,210 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,210 INFO L82 PathProgramCache]: Analyzing trace with hash -301701102, now seen corresponding path program 1 times [2018-11-10 12:20:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:12,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,251 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,252 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 3 states. [2018-11-10 12:20:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,277 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2018-11-10 12:20:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:20:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,279 INFO L225 Difference]: With dead ends: 121 [2018-11-10 12:20:12,279 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 12:20:12,279 INFO L605 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-10 12:20:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 12:20:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-10 12:20:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 12:20:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2018-11-10 12:20:12,285 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 23 [2018-11-10 12:20:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,285 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2018-11-10 12:20:12,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2018-11-10 12:20:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:20:12,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,286 INFO L375 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-10 12:20:12,286 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1581564780, now seen corresponding path program 1 times [2018-11-10 12:20:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,311 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-10 12:20:12,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,312 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand 3 states. [2018-11-10 12:20:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,328 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2018-11-10 12:20:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:20:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,329 INFO L225 Difference]: With dead ends: 153 [2018-11-10 12:20:12,329 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 12:20:12,329 INFO L605 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-10 12:20:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 12:20:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-11-10 12:20:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 12:20:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-11-10 12:20:12,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 23 [2018-11-10 12:20:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,337 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-11-10 12:20:12,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-11-10 12:20:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:20:12,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,338 INFO L375 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-10 12:20:12,338 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1702285266, now seen corresponding path program 1 times [2018-11-10 12:20:12,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,390 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-10 12:20:12,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,390 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,391 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 3 states. [2018-11-10 12:20:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,410 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2018-11-10 12:20:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:20:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,412 INFO L225 Difference]: With dead ends: 251 [2018-11-10 12:20:12,412 INFO L226 Difference]: Without dead ends: 153 [2018-11-10 12:20:12,413 INFO L605 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-10 12:20:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-10 12:20:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-10 12:20:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 12:20:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 263 transitions. [2018-11-10 12:20:12,421 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 263 transitions. Word has length 23 [2018-11-10 12:20:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,421 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 263 transitions. [2018-11-10 12:20:12,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 263 transitions. [2018-11-10 12:20:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:20:12,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,422 INFO L375 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-10 12:20:12,422 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1783654526, now seen corresponding path program 1 times [2018-11-10 12:20:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,454 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-10 12:20:12,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,455 INFO L87 Difference]: Start difference. First operand 151 states and 263 transitions. Second operand 3 states. [2018-11-10 12:20:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,478 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2018-11-10 12:20:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:20:12,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,479 INFO L225 Difference]: With dead ends: 226 [2018-11-10 12:20:12,479 INFO L226 Difference]: Without dead ends: 155 [2018-11-10 12:20:12,480 INFO L605 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-10 12:20:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-10 12:20:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-10 12:20:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 12:20:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 263 transitions. [2018-11-10 12:20:12,486 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 263 transitions. Word has length 24 [2018-11-10 12:20:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,486 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 263 transitions. [2018-11-10 12:20:12,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 263 transitions. [2018-11-10 12:20:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:20:12,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,487 INFO L375 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-10 12:20:12,487 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1231449092, now seen corresponding path program 1 times [2018-11-10 12:20:12,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,515 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-10 12:20:12,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,515 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,516 INFO L87 Difference]: Start difference. First operand 153 states and 263 transitions. Second operand 3 states. [2018-11-10 12:20:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,548 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2018-11-10 12:20:12,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:20:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,550 INFO L225 Difference]: With dead ends: 285 [2018-11-10 12:20:12,550 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 12:20:12,550 INFO L605 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-10 12:20:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 12:20:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 205. [2018-11-10 12:20:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 12:20:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 351 transitions. [2018-11-10 12:20:12,560 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 351 transitions. Word has length 24 [2018-11-10 12:20:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,561 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 351 transitions. [2018-11-10 12:20:12,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 351 transitions. [2018-11-10 12:20:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 12:20:12,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,562 INFO L375 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-10 12:20:12,562 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash 220331842, now seen corresponding path program 1 times [2018-11-10 12:20:12,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,585 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-10 12:20:12,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,586 INFO L87 Difference]: Start difference. First operand 205 states and 351 transitions. Second operand 3 states. [2018-11-10 12:20:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,606 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2018-11-10 12:20:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 12:20:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,608 INFO L225 Difference]: With dead ends: 485 [2018-11-10 12:20:12,608 INFO L226 Difference]: Without dead ends: 291 [2018-11-10 12:20:12,608 INFO L605 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-10 12:20:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-10 12:20:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-11-10 12:20:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-10 12:20:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 491 transitions. [2018-11-10 12:20:12,618 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 491 transitions. Word has length 24 [2018-11-10 12:20:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,618 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 491 transitions. [2018-11-10 12:20:12,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 491 transitions. [2018-11-10 12:20:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:20:12,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,619 INFO L375 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-10 12:20:12,619 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,620 INFO L82 PathProgramCache]: Analyzing trace with hash -479570073, now seen corresponding path program 1 times [2018-11-10 12:20:12,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,621 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,645 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-10 12:20:12,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,646 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,646 INFO L87 Difference]: Start difference. First operand 289 states and 491 transitions. Second operand 3 states. [2018-11-10 12:20:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,659 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2018-11-10 12:20:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:20:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,661 INFO L225 Difference]: With dead ends: 433 [2018-11-10 12:20:12,661 INFO L226 Difference]: Without dead ends: 295 [2018-11-10 12:20:12,661 INFO L605 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-10 12:20:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-10 12:20:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-11-10 12:20:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-10 12:20:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 491 transitions. [2018-11-10 12:20:12,668 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 491 transitions. Word has length 25 [2018-11-10 12:20:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,669 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 491 transitions. [2018-11-10 12:20:12,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 491 transitions. [2018-11-10 12:20:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:20:12,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,670 INFO L375 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-10 12:20:12,670 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1759433751, now seen corresponding path program 1 times [2018-11-10 12:20:12,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,693 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-10 12:20:12,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,695 INFO L87 Difference]: Start difference. First operand 293 states and 491 transitions. Second operand 3 states. [2018-11-10 12:20:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,710 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2018-11-10 12:20:12,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:20:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,712 INFO L225 Difference]: With dead ends: 541 [2018-11-10 12:20:12,712 INFO L226 Difference]: Without dead ends: 539 [2018-11-10 12:20:12,712 INFO L605 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-10 12:20:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-10 12:20:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2018-11-10 12:20:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-10 12:20:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2018-11-10 12:20:12,723 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 25 [2018-11-10 12:20:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,724 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2018-11-10 12:20:12,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2018-11-10 12:20:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 12:20:12,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,725 INFO L375 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-10 12:20:12,725 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1524416295, now seen corresponding path program 1 times [2018-11-10 12:20:12,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,750 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-10 12:20:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,750 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,751 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand 3 states. [2018-11-10 12:20:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,776 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2018-11-10 12:20:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 12:20:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,778 INFO L225 Difference]: With dead ends: 949 [2018-11-10 12:20:12,778 INFO L226 Difference]: Without dead ends: 563 [2018-11-10 12:20:12,779 INFO L605 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-10 12:20:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-10 12:20:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2018-11-10 12:20:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-10 12:20:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2018-11-10 12:20:12,790 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 25 [2018-11-10 12:20:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,790 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2018-11-10 12:20:12,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2018-11-10 12:20:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:20:12,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:12,792 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1292342647, now seen corresponding path program 1 times [2018-11-10 12:20:12,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,810 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-10 12:20:12,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,810 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,811 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand 3 states. [2018-11-10 12:20:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,832 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2018-11-10 12:20:12,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:20:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,834 INFO L225 Difference]: With dead ends: 841 [2018-11-10 12:20:12,835 INFO L226 Difference]: Without dead ends: 571 [2018-11-10 12:20:12,835 INFO L605 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-10 12:20:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-10 12:20:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2018-11-10 12:20:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-10 12:20:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 919 transitions. [2018-11-10 12:20:12,846 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 919 transitions. Word has length 26 [2018-11-10 12:20:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,847 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 919 transitions. [2018-11-10 12:20:12,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 919 transitions. [2018-11-10 12:20:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:20:12,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:12,848 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 12478969, now seen corresponding path program 1 times [2018-11-10 12:20:12,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,865 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-10 12:20:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,866 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,867 INFO L87 Difference]: Start difference. First operand 569 states and 919 transitions. Second operand 3 states. [2018-11-10 12:20:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,896 INFO L93 Difference]: Finished difference Result 1645 states and 2649 transitions. [2018-11-10 12:20:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:20:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,899 INFO L225 Difference]: With dead ends: 1645 [2018-11-10 12:20:12,899 INFO L226 Difference]: Without dead ends: 1099 [2018-11-10 12:20:12,900 INFO L605 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-10 12:20:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-10 12:20:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2018-11-10 12:20:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-10 12:20:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1735 transitions. [2018-11-10 12:20:12,920 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1735 transitions. Word has length 26 [2018-11-10 12:20:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:12,921 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1735 transitions. [2018-11-10 12:20:12,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1735 transitions. [2018-11-10 12:20:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:20:12,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:12,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:12,922 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:12,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1023596219, now seen corresponding path program 1 times [2018-11-10 12:20:12,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:12,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:20:12,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:12,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:12,942 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:12,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:12,943 INFO L87 Difference]: Start difference. First operand 1097 states and 1735 transitions. Second operand 3 states. [2018-11-10 12:20:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:12,991 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2018-11-10 12:20:12,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:12,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 12:20:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:12,996 INFO L225 Difference]: With dead ends: 1341 [2018-11-10 12:20:12,996 INFO L226 Difference]: Without dead ends: 1339 [2018-11-10 12:20:12,997 INFO L605 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-10 12:20:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-10 12:20:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1097. [2018-11-10 12:20:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-10 12:20:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1719 transitions. [2018-11-10 12:20:13,029 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1719 transitions. Word has length 26 [2018-11-10 12:20:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,030 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1719 transitions. [2018-11-10 12:20:13,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1719 transitions. [2018-11-10 12:20:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:20:13,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,031 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,032 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash 387062460, now seen corresponding path program 1 times [2018-11-10 12:20:13,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,047 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-10 12:20:13,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,047 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,048 INFO L87 Difference]: Start difference. First operand 1097 states and 1719 transitions. Second operand 3 states. [2018-11-10 12:20:13,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,096 INFO L93 Difference]: Finished difference Result 1981 states and 3161 transitions. [2018-11-10 12:20:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:20:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,102 INFO L225 Difference]: With dead ends: 1981 [2018-11-10 12:20:13,103 INFO L226 Difference]: Without dead ends: 1979 [2018-11-10 12:20:13,103 INFO L605 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-10 12:20:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-11-10 12:20:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1561. [2018-11-10 12:20:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-10 12:20:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2391 transitions. [2018-11-10 12:20:13,147 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2391 transitions. Word has length 27 [2018-11-10 12:20:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,148 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2391 transitions. [2018-11-10 12:20:13,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2391 transitions. [2018-11-10 12:20:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:20:13,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,150 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash -624054790, now seen corresponding path program 1 times [2018-11-10 12:20:13,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,152 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,166 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-10 12:20:13,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,167 INFO L87 Difference]: Start difference. First operand 1561 states and 2391 transitions. Second operand 3 states. [2018-11-10 12:20:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,216 INFO L93 Difference]: Finished difference Result 3677 states and 5657 transitions. [2018-11-10 12:20:13,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 12:20:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,222 INFO L225 Difference]: With dead ends: 3677 [2018-11-10 12:20:13,222 INFO L226 Difference]: Without dead ends: 2139 [2018-11-10 12:20:13,224 INFO L605 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-10 12:20:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-10 12:20:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2018-11-10 12:20:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-10 12:20:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3239 transitions. [2018-11-10 12:20:13,281 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3239 transitions. Word has length 27 [2018-11-10 12:20:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,281 INFO L481 AbstractCegarLoop]: Abstraction has 2137 states and 3239 transitions. [2018-11-10 12:20:13,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3239 transitions. [2018-11-10 12:20:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:20:13,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,284 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -885750866, now seen corresponding path program 1 times [2018-11-10 12:20:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,301 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-10 12:20:13,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,302 INFO L87 Difference]: Start difference. First operand 2137 states and 3239 transitions. Second operand 3 states. [2018-11-10 12:20:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,348 INFO L93 Difference]: Finished difference Result 3229 states and 4889 transitions. [2018-11-10 12:20:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:20:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,355 INFO L225 Difference]: With dead ends: 3229 [2018-11-10 12:20:13,355 INFO L226 Difference]: Without dead ends: 2187 [2018-11-10 12:20:13,357 INFO L605 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-10 12:20:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-10 12:20:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2185. [2018-11-10 12:20:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-11-10 12:20:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3271 transitions. [2018-11-10 12:20:13,422 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3271 transitions. Word has length 28 [2018-11-10 12:20:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,423 INFO L481 AbstractCegarLoop]: Abstraction has 2185 states and 3271 transitions. [2018-11-10 12:20:13,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3271 transitions. [2018-11-10 12:20:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:20:13,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,426 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2129352752, now seen corresponding path program 1 times [2018-11-10 12:20:13,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,450 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-10 12:20:13,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,451 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,452 INFO L87 Difference]: Start difference. First operand 2185 states and 3271 transitions. Second operand 3 states. [2018-11-10 12:20:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,542 INFO L93 Difference]: Finished difference Result 3853 states and 5865 transitions. [2018-11-10 12:20:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:20:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,553 INFO L225 Difference]: With dead ends: 3853 [2018-11-10 12:20:13,553 INFO L226 Difference]: Without dead ends: 3851 [2018-11-10 12:20:13,554 INFO L605 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-10 12:20:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-10 12:20:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3145. [2018-11-10 12:20:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-10 12:20:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4583 transitions. [2018-11-10 12:20:13,628 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4583 transitions. Word has length 28 [2018-11-10 12:20:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,628 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 4583 transitions. [2018-11-10 12:20:13,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4583 transitions. [2018-11-10 12:20:13,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 12:20:13,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,631 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,632 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1118235502, now seen corresponding path program 1 times [2018-11-10 12:20:13,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,649 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-10 12:20:13,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,650 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,650 INFO L87 Difference]: Start difference. First operand 3145 states and 4583 transitions. Second operand 3 states. [2018-11-10 12:20:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,734 INFO L93 Difference]: Finished difference Result 7309 states and 10665 transitions. [2018-11-10 12:20:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 12:20:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,745 INFO L225 Difference]: With dead ends: 7309 [2018-11-10 12:20:13,745 INFO L226 Difference]: Without dead ends: 4235 [2018-11-10 12:20:13,749 INFO L605 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-10 12:20:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-10 12:20:13,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4233. [2018-11-10 12:20:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2018-11-10 12:20:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6087 transitions. [2018-11-10 12:20:13,859 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6087 transitions. Word has length 28 [2018-11-10 12:20:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:13,859 INFO L481 AbstractCegarLoop]: Abstraction has 4233 states and 6087 transitions. [2018-11-10 12:20:13,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6087 transitions. [2018-11-10 12:20:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:20:13,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:13,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:13,863 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:13,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1585640975, now seen corresponding path program 1 times [2018-11-10 12:20:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:13,864 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:13,879 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-10 12:20:13,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:13,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:13,880 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:13,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:13,881 INFO L87 Difference]: Start difference. First operand 4233 states and 6087 transitions. Second operand 3 states. [2018-11-10 12:20:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:13,943 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2018-11-10 12:20:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:13,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:20:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:13,954 INFO L225 Difference]: With dead ends: 6349 [2018-11-10 12:20:13,954 INFO L226 Difference]: Without dead ends: 4299 [2018-11-10 12:20:13,958 INFO L605 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-10 12:20:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2018-11-10 12:20:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2018-11-10 12:20:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2018-11-10 12:20:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6087 transitions. [2018-11-10 12:20:14,061 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6087 transitions. Word has length 29 [2018-11-10 12:20:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:14,062 INFO L481 AbstractCegarLoop]: Abstraction has 4297 states and 6087 transitions. [2018-11-10 12:20:14,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6087 transitions. [2018-11-10 12:20:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:20:14,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:14,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:14,066 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:14,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:14,066 INFO L82 PathProgramCache]: Analyzing trace with hash 305777297, now seen corresponding path program 1 times [2018-11-10 12:20:14,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:14,084 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-10 12:20:14,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:14,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:14,084 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:14,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:14,085 INFO L87 Difference]: Start difference. First operand 4297 states and 6087 transitions. Second operand 3 states. [2018-11-10 12:20:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:14,179 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2018-11-10 12:20:14,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:14,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:20:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:14,192 INFO L225 Difference]: With dead ends: 7437 [2018-11-10 12:20:14,192 INFO L226 Difference]: Without dead ends: 7435 [2018-11-10 12:20:14,194 INFO L605 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-10 12:20:14,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-11-10 12:20:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6281. [2018-11-10 12:20:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2018-11-10 12:20:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8647 transitions. [2018-11-10 12:20:14,324 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8647 transitions. Word has length 29 [2018-11-10 12:20:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:14,324 INFO L481 AbstractCegarLoop]: Abstraction has 6281 states and 8647 transitions. [2018-11-10 12:20:14,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8647 transitions. [2018-11-10 12:20:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 12:20:14,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:14,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:14,331 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:14,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash -705339953, now seen corresponding path program 1 times [2018-11-10 12:20:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:14,346 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-10 12:20:14,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:14,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:14,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:14,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:14,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:14,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:14,348 INFO L87 Difference]: Start difference. First operand 6281 states and 8647 transitions. Second operand 3 states. [2018-11-10 12:20:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:14,480 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2018-11-10 12:20:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:14,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 12:20:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:14,496 INFO L225 Difference]: With dead ends: 14477 [2018-11-10 12:20:14,496 INFO L226 Difference]: Without dead ends: 8331 [2018-11-10 12:20:14,505 INFO L605 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-10 12:20:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2018-11-10 12:20:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 8329. [2018-11-10 12:20:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-10 12:20:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11271 transitions. [2018-11-10 12:20:14,734 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11271 transitions. Word has length 29 [2018-11-10 12:20:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:14,735 INFO L481 AbstractCegarLoop]: Abstraction has 8329 states and 11271 transitions. [2018-11-10 12:20:14,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11271 transitions. [2018-11-10 12:20:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:20:14,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:14,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:14,742 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:14,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:14,742 INFO L82 PathProgramCache]: Analyzing trace with hash 889377059, now seen corresponding path program 1 times [2018-11-10 12:20:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:14,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:14,743 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:14,771 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-10 12:20:14,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:14,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:14,771 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:14,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:14,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:14,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:14,772 INFO L87 Difference]: Start difference. First operand 8329 states and 11271 transitions. Second operand 3 states. [2018-11-10 12:20:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:14,893 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2018-11-10 12:20:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:14,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:20:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:14,907 INFO L225 Difference]: With dead ends: 12493 [2018-11-10 12:20:14,907 INFO L226 Difference]: Without dead ends: 8459 [2018-11-10 12:20:14,913 INFO L605 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-10 12:20:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2018-11-10 12:20:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8457. [2018-11-10 12:20:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2018-11-10 12:20:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 11271 transitions. [2018-11-10 12:20:15,078 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 11271 transitions. Word has length 30 [2018-11-10 12:20:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:15,078 INFO L481 AbstractCegarLoop]: Abstraction has 8457 states and 11271 transitions. [2018-11-10 12:20:15,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 11271 transitions. [2018-11-10 12:20:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:20:15,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:15,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:15,085 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:15,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash -390486619, now seen corresponding path program 1 times [2018-11-10 12:20:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:15,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:15,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:15,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:15,102 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-10 12:20:15,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:15,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:15,102 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:15,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:15,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:15,103 INFO L87 Difference]: Start difference. First operand 8457 states and 11271 transitions. Second operand 3 states. [2018-11-10 12:20:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:15,271 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2018-11-10 12:20:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:15,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:20:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:15,292 INFO L225 Difference]: With dead ends: 14349 [2018-11-10 12:20:15,292 INFO L226 Difference]: Without dead ends: 14347 [2018-11-10 12:20:15,296 INFO L605 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-10 12:20:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2018-11-10 12:20:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 12553. [2018-11-10 12:20:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2018-11-10 12:20:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 16263 transitions. [2018-11-10 12:20:15,508 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 16263 transitions. Word has length 30 [2018-11-10 12:20:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:15,509 INFO L481 AbstractCegarLoop]: Abstraction has 12553 states and 16263 transitions. [2018-11-10 12:20:15,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 16263 transitions. [2018-11-10 12:20:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:20:15,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:15,519 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:15,519 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:15,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1401603869, now seen corresponding path program 1 times [2018-11-10 12:20:15,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:15,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:15,544 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-10 12:20:15,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:15,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:15,545 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:15,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:15,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:15,545 INFO L87 Difference]: Start difference. First operand 12553 states and 16263 transitions. Second operand 3 states. [2018-11-10 12:20:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:15,786 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2018-11-10 12:20:15,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:15,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 12:20:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:15,808 INFO L225 Difference]: With dead ends: 28685 [2018-11-10 12:20:15,809 INFO L226 Difference]: Without dead ends: 16395 [2018-11-10 12:20:15,821 INFO L605 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-10 12:20:15,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2018-11-10 12:20:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16393. [2018-11-10 12:20:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2018-11-10 12:20:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 20743 transitions. [2018-11-10 12:20:16,133 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 20743 transitions. Word has length 30 [2018-11-10 12:20:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:16,133 INFO L481 AbstractCegarLoop]: Abstraction has 16393 states and 20743 transitions. [2018-11-10 12:20:16,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 20743 transitions. [2018-11-10 12:20:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:20:16,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:16,143 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:16,143 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:16,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 780032484, now seen corresponding path program 1 times [2018-11-10 12:20:16,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,144 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:16,166 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-10 12:20:16,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:16,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:16,166 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:16,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:16,167 INFO L87 Difference]: Start difference. First operand 16393 states and 20743 transitions. Second operand 3 states. [2018-11-10 12:20:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:16,322 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2018-11-10 12:20:16,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:16,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:20:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:16,342 INFO L225 Difference]: With dead ends: 24589 [2018-11-10 12:20:16,343 INFO L226 Difference]: Without dead ends: 16651 [2018-11-10 12:20:16,354 INFO L605 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-10 12:20:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2018-11-10 12:20:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 16649. [2018-11-10 12:20:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-10 12:20:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 20743 transitions. [2018-11-10 12:20:16,676 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 20743 transitions. Word has length 31 [2018-11-10 12:20:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:16,676 INFO L481 AbstractCegarLoop]: Abstraction has 16649 states and 20743 transitions. [2018-11-10 12:20:16,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 20743 transitions. [2018-11-10 12:20:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:20:16,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:16,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:16,681 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:16,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash -499831194, now seen corresponding path program 1 times [2018-11-10 12:20:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:16,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:16,701 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-10 12:20:16,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:16,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:16,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:16,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:16,702 INFO L87 Difference]: Start difference. First operand 16649 states and 20743 transitions. Second operand 3 states. [2018-11-10 12:20:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:16,922 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2018-11-10 12:20:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:16,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:20:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:16,945 INFO L225 Difference]: With dead ends: 27661 [2018-11-10 12:20:16,945 INFO L226 Difference]: Without dead ends: 27659 [2018-11-10 12:20:16,952 INFO L605 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-10 12:20:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2018-11-10 12:20:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25097. [2018-11-10 12:20:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-11-10 12:20:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 30471 transitions. [2018-11-10 12:20:17,269 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 30471 transitions. Word has length 31 [2018-11-10 12:20:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:17,270 INFO L481 AbstractCegarLoop]: Abstraction has 25097 states and 30471 transitions. [2018-11-10 12:20:17,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 30471 transitions. [2018-11-10 12:20:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 12:20:17,280 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:17,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:17,280 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:17,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1510948444, now seen corresponding path program 1 times [2018-11-10 12:20:17,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:17,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:17,302 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-10 12:20:17,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:17,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:17,303 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:17,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:17,303 INFO L87 Difference]: Start difference. First operand 25097 states and 30471 transitions. Second operand 3 states. [2018-11-10 12:20:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:17,688 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2018-11-10 12:20:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:17,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 12:20:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:17,705 INFO L225 Difference]: With dead ends: 56845 [2018-11-10 12:20:17,705 INFO L226 Difference]: Without dead ends: 32267 [2018-11-10 12:20:17,723 INFO L605 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-10 12:20:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2018-11-10 12:20:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32265. [2018-11-10 12:20:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2018-11-10 12:20:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 37895 transitions. [2018-11-10 12:20:18,113 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 37895 transitions. Word has length 31 [2018-11-10 12:20:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:18,113 INFO L481 AbstractCegarLoop]: Abstraction has 32265 states and 37895 transitions. [2018-11-10 12:20:18,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 37895 transitions. [2018-11-10 12:20:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:20:18,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:18,123 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:18,123 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:18,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:18,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1685318296, now seen corresponding path program 1 times [2018-11-10 12:20:18,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:18,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:18,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:18,124 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:18,154 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-10 12:20:18,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:18,154 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:18,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:18,155 INFO L87 Difference]: Start difference. First operand 32265 states and 37895 transitions. Second operand 3 states. [2018-11-10 12:20:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:18,470 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2018-11-10 12:20:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:18,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:20:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:18,493 INFO L225 Difference]: With dead ends: 48397 [2018-11-10 12:20:18,608 INFO L226 Difference]: Without dead ends: 32779 [2018-11-10 12:20:18,616 INFO L605 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-10 12:20:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2018-11-10 12:20:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 32777. [2018-11-10 12:20:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2018-11-10 12:20:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 37895 transitions. [2018-11-10 12:20:18,999 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 37895 transitions. Word has length 32 [2018-11-10 12:20:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:18,999 INFO L481 AbstractCegarLoop]: Abstraction has 32777 states and 37895 transitions. [2018-11-10 12:20:18,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 37895 transitions. [2018-11-10 12:20:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:20:19,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:19,010 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:19,011 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:19,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 405454618, now seen corresponding path program 1 times [2018-11-10 12:20:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:19,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:19,045 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-10 12:20:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:19,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:19,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:19,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:19,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:19,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:19,046 INFO L87 Difference]: Start difference. First operand 32777 states and 37895 transitions. Second operand 3 states. [2018-11-10 12:20:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:19,503 INFO L93 Difference]: Finished difference Result 53259 states and 60936 transitions. [2018-11-10 12:20:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:19,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:20:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:19,542 INFO L225 Difference]: With dead ends: 53259 [2018-11-10 12:20:19,543 INFO L226 Difference]: Without dead ends: 53257 [2018-11-10 12:20:19,551 INFO L605 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-10 12:20:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2018-11-10 12:20:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 50185. [2018-11-10 12:20:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50185 states. [2018-11-10 12:20:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50185 states to 50185 states and 56839 transitions. [2018-11-10 12:20:20,248 INFO L78 Accepts]: Start accepts. Automaton has 50185 states and 56839 transitions. Word has length 32 [2018-11-10 12:20:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:20,248 INFO L481 AbstractCegarLoop]: Abstraction has 50185 states and 56839 transitions. [2018-11-10 12:20:20,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 50185 states and 56839 transitions. [2018-11-10 12:20:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 12:20:20,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:20:20,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:20:20,273 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:20:20,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:20:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash -605662632, now seen corresponding path program 1 times [2018-11-10 12:20:20,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:20:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:20,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:20:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:20:20,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:20:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:20:20,294 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-10 12:20:20,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:20:20,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:20:20,295 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:20:20,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:20:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:20:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:20:20,295 INFO L87 Difference]: Start difference. First operand 50185 states and 56839 transitions. Second operand 3 states. [2018-11-10 12:20:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:20:20,879 INFO L93 Difference]: Finished difference Result 112649 states and 125447 transitions. [2018-11-10 12:20:20,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:20:20,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 12:20:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:20:20,880 INFO L225 Difference]: With dead ends: 112649 [2018-11-10 12:20:20,880 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:20:20,933 INFO L605 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-10 12:20:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:20:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:20:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:20:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:20:20,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-10 12:20:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:20:20,934 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:20:20,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:20:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:20:20,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:20:20,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:20:20,963 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:20:20,963 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:20:20,964 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-10 12:20:20,964 INFO L421 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-10 12:20:20,965 INFO L425 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L428 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,966 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 12:20:20,967 INFO L428 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-10 12:20:20,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:20:20 BoogieIcfgContainer [2018-11-10 12:20:20,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:20:20,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:20:20,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:20:20,978 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:20:20,978 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:20:11" (3/4) ... [2018-11-10 12:20:20,983 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:20:20,989 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:20:20,989 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:20:20,994 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 12:20:20,994 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 12:20:20,994 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:20:21,043 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ce707d69-a165-47b3-add8-754800bdbebb/bin-2019/utaipan/witness.graphml [2018-11-10 12:20:21,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:20:21,044 INFO L168 Benchmark]: Toolchain (without parser) took 9712.84 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 885.5 MB). Free memory was 959.2 MB in the beginning and 768.5 MB in the end (delta: 190.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 12:20:21,046 INFO L168 Benchmark]: CDTParser took 0.16 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-10 12:20:21,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:21,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:21,047 INFO L168 Benchmark]: Boogie Preprocessor took 19.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:21,047 INFO L168 Benchmark]: RCFGBuilder took 270.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:20:21,047 INFO L168 Benchmark]: TraceAbstraction took 9184.72 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 758.1 MB). Free memory was 1.1 GB in the beginning and 768.5 MB in the end (delta: 334.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 12:20:21,047 INFO L168 Benchmark]: Witness Printer took 65.76 ms. Allocated memory is still 1.9 GB. Free memory is still 768.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:20:21,049 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.16 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 156.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.88 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.31 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 270.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9184.72 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 758.1 MB). Free memory was 1.1 GB in the beginning and 768.5 MB in the end (delta: 334.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 65.76 ms. Allocated memory is still 1.9 GB. Free memory is still 768.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 48 locations, 1 error locations. SAFE Result, 9.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1433 SDslu, 1995 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50185occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 10271 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 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.5s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 42564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...