./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/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 c5a3d22d49117f02662b197492bc1b16616a2878 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:46:06,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:46:06,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:46:06,981 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:46:06,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:46:06,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:46:06,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:46:06,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:46:06,985 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:46:06,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:46:06,986 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:46:06,986 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:46:06,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:46:06,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:46:06,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:46:06,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:46:06,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:46:06,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:46:06,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:46:06,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:46:06,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:46:06,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:46:06,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:46:06,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:46:06,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:46:06,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:46:07,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:46:07,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:46:07,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:46:07,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:46:07,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:46:07,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:46:07,003 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:46:07,003 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:46:07,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:46:07,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:46:07,004 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:46:07,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:46:07,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:46:07,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:46:07,016 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:46:07,016 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:46:07,016 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:46:07,016 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:46:07,017 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:46:07,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:46:07,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:46:07,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:46:07,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:46:07,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:46:07,020 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:46:07,021 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_308052d0-66d6-49d2-a1e9-d58a301648ef/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-22 21:46:07,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:46:07,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:46:07,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:46:07,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:46:07,064 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:46:07,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:46:07,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/data/7955799a1/816869d038ba4a76806421d11197daff/FLAG1baabd53f [2018-11-22 21:46:07,472 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:46:07,472 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:46:07,480 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/data/7955799a1/816869d038ba4a76806421d11197daff/FLAG1baabd53f [2018-11-22 21:46:07,880 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/data/7955799a1/816869d038ba4a76806421d11197daff [2018-11-22 21:46:07,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:46:07,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:46:07,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:46:07,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:46:07,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:46:07,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:07" (1/1) ... [2018-11-22 21:46:07,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5e9553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:07, skipping insertion in model container [2018-11-22 21:46:07,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:07" (1/1) ... [2018-11-22 21:46:07,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:46:07,913 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:46:08,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:46:08,051 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:46:08,075 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:46:08,085 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:46:08,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08 WrapperNode [2018-11-22 21:46:08,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:46:08,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:46:08,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:46:08,086 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:46:08,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:46:08,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:46:08,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:46:08,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:46:08,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... [2018-11-22 21:46:08,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:46:08,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:46:08,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:46:08,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:46:08,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/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-22 21:46:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:46:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:46:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:46:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:46:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:46:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:46:08,437 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:46:08,438 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:46:08,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:08 BoogieIcfgContainer [2018-11-22 21:46:08,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:46:08,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:46:08,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:46:08,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:46:08,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:46:07" (1/3) ... [2018-11-22 21:46:08,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e540de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:08, skipping insertion in model container [2018-11-22 21:46:08,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:08" (2/3) ... [2018-11-22 21:46:08,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e540de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:08, skipping insertion in model container [2018-11-22 21:46:08,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:08" (3/3) ... [2018-11-22 21:46:08,445 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:46:08,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:46:08,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:46:08,469 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:46:08,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:46:08,502 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:46:08,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:46:08,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:46:08,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:46:08,502 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:46:08,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:46:08,502 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:46:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-22 21:46:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:46:08,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:08,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:08,525 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:08,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:08,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-11-22 21:46:08,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:08,671 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-22 21:46:08,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:08,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:08,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:08,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,688 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-22 21:46:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:08,728 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-11-22 21:46:08,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:08,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 21:46:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:08,739 INFO L225 Difference]: With dead ends: 111 [2018-11-22 21:46:08,739 INFO L226 Difference]: Without dead ends: 96 [2018-11-22 21:46:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-22 21:46:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-22 21:46:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-22 21:46:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-11-22 21:46:08,777 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-11-22 21:46:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:08,777 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-11-22 21:46:08,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-11-22 21:46:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:46:08,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:08,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:08,779 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:08,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-11-22 21:46:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:08,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:08,839 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-22 21:46:08,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:08,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:08,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:08,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,842 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-11-22 21:46:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:08,878 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-11-22 21:46:08,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:08,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 21:46:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:08,880 INFO L225 Difference]: With dead ends: 157 [2018-11-22 21:46:08,880 INFO L226 Difference]: Without dead ends: 96 [2018-11-22 21:46:08,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-22 21:46:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-22 21:46:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-22 21:46:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-11-22 21:46:08,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-11-22 21:46:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:08,889 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-11-22 21:46:08,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-11-22 21:46:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:46:08,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:08,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:08,890 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:08,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-11-22 21:46:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:08,941 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-22 21:46:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:08,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:08,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,943 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-11-22 21:46:08,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:08,956 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-11-22 21:46:08,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:08,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:46:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:08,958 INFO L225 Difference]: With dead ends: 144 [2018-11-22 21:46:08,958 INFO L226 Difference]: Without dead ends: 99 [2018-11-22 21:46:08,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-22 21:46:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-22 21:46:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-22 21:46:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-11-22 21:46:08,968 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-11-22 21:46:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:08,968 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-11-22 21:46:08,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-11-22 21:46:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:46:08,970 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:08,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:08,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:08,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-11-22 21:46:08,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:08,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:08,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,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-22 21:46:09,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,016 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-11-22 21:46:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,034 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-11-22 21:46:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:46:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,036 INFO L225 Difference]: With dead ends: 184 [2018-11-22 21:46:09,036 INFO L226 Difference]: Without dead ends: 182 [2018-11-22 21:46:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-22 21:46:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-11-22 21:46:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-22 21:46:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-11-22 21:46:09,046 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-11-22 21:46:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,047 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-11-22 21:46:09,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-11-22 21:46:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:46:09,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-11-22 21:46:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,094 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-22 21:46:09,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,095 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-11-22 21:46:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,121 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-11-22 21:46:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:46:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,123 INFO L225 Difference]: With dead ends: 304 [2018-11-22 21:46:09,123 INFO L226 Difference]: Without dead ends: 184 [2018-11-22 21:46:09,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-22 21:46:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-22 21:46:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-22 21:46:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-11-22 21:46:09,134 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-11-22 21:46:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,135 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-11-22 21:46:09,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-11-22 21:46:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:46:09,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,136 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-11-22 21:46:09,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,168 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-22 21:46:09,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,170 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-11-22 21:46:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,192 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-11-22 21:46:09,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:46:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,193 INFO L225 Difference]: With dead ends: 273 [2018-11-22 21:46:09,193 INFO L226 Difference]: Without dead ends: 186 [2018-11-22 21:46:09,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-22 21:46:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-22 21:46:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-22 21:46:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-11-22 21:46:09,206 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-11-22 21:46:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-11-22 21:46:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-11-22 21:46:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:46:09,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-11-22 21:46:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,257 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-22 21:46:09,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,258 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-11-22 21:46:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,281 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-11-22 21:46:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:46:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,283 INFO L225 Difference]: With dead ends: 348 [2018-11-22 21:46:09,283 INFO L226 Difference]: Without dead ends: 346 [2018-11-22 21:46:09,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-22 21:46:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-11-22 21:46:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-22 21:46:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-11-22 21:46:09,292 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-11-22 21:46:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,293 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-11-22 21:46:09,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-11-22 21:46:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:46:09,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,294 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-11-22 21:46:09,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:46:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,323 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-11-22 21:46:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,343 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-11-22 21:46:09,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:46:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,345 INFO L225 Difference]: With dead ends: 592 [2018-11-22 21:46:09,345 INFO L226 Difference]: Without dead ends: 354 [2018-11-22 21:46:09,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-22 21:46:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-22 21:46:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-22 21:46:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-11-22 21:46:09,357 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-11-22 21:46:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,357 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-11-22 21:46:09,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-11-22 21:46:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:46:09,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,359 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-11-22 21:46:09,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,406 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-22 21:46:09,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,407 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-11-22 21:46:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,430 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-11-22 21:46:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:46:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,432 INFO L225 Difference]: With dead ends: 528 [2018-11-22 21:46:09,432 INFO L226 Difference]: Without dead ends: 358 [2018-11-22 21:46:09,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-22 21:46:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-11-22 21:46:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-22 21:46:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-11-22 21:46:09,442 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-11-22 21:46:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,442 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-11-22 21:46:09,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-11-22 21:46:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:46:09,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,446 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-11-22 21:46:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,478 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-22 21:46:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,480 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-11-22 21:46:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,507 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-11-22 21:46:09,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:46:09,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,512 INFO L225 Difference]: With dead ends: 668 [2018-11-22 21:46:09,520 INFO L226 Difference]: Without dead ends: 666 [2018-11-22 21:46:09,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-22 21:46:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-11-22 21:46:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-22 21:46:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-11-22 21:46:09,537 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-11-22 21:46:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,537 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-11-22 21:46:09,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-11-22 21:46:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:46:09,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,539 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-11-22 21:46:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,570 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-22 21:46:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,572 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-11-22 21:46:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,599 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-11-22 21:46:09,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:46:09,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,602 INFO L225 Difference]: With dead ends: 1164 [2018-11-22 21:46:09,602 INFO L226 Difference]: Without dead ends: 690 [2018-11-22 21:46:09,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-22 21:46:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-11-22 21:46:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-22 21:46:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-11-22 21:46:09,626 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-11-22 21:46:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,627 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-11-22 21:46:09,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-11-22 21:46:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:46:09,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,629 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-11-22 21:46:09,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,650 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-22 21:46:09,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,652 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-11-22 21:46:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,690 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-11-22 21:46:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:46:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,693 INFO L225 Difference]: With dead ends: 1032 [2018-11-22 21:46:09,693 INFO L226 Difference]: Without dead ends: 698 [2018-11-22 21:46:09,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-22 21:46:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-22 21:46:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-22 21:46:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-11-22 21:46:09,717 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-11-22 21:46:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,718 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-11-22 21:46:09,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-11-22 21:46:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:46:09,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,719 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-11-22 21:46:09,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,751 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-22 21:46:09,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,752 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-11-22 21:46:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,790 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-11-22 21:46:09,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:46:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,795 INFO L225 Difference]: With dead ends: 1292 [2018-11-22 21:46:09,795 INFO L226 Difference]: Without dead ends: 1290 [2018-11-22 21:46:09,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-22 21:46:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-11-22 21:46:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-22 21:46:09,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-11-22 21:46:09,828 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-11-22 21:46:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,828 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-11-22 21:46:09,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-11-22 21:46:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:46:09,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,830 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-11-22 21:46:09,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,850 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-22 21:46:09,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,852 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-11-22 21:46:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:09,895 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-11-22 21:46:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:09,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:46:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:09,900 INFO L225 Difference]: With dead ends: 2300 [2018-11-22 21:46:09,900 INFO L226 Difference]: Without dead ends: 1354 [2018-11-22 21:46:09,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-22 21:46:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-22 21:46:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-22 21:46:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-11-22 21:46:09,946 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-11-22 21:46:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:09,947 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-11-22 21:46:09,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-11-22 21:46:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:46:09,949 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:09,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:09,949 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:09,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-11-22 21:46:09,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:09,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:09,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:09,977 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-22 21:46:09,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:09,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:09,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:09,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:09,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:09,978 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-11-22 21:46:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,017 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-11-22 21:46:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:46:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,023 INFO L225 Difference]: With dead ends: 2028 [2018-11-22 21:46:10,023 INFO L226 Difference]: Without dead ends: 1370 [2018-11-22 21:46:10,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-22 21:46:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-11-22 21:46:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-11-22 21:46:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-11-22 21:46:10,072 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-11-22 21:46:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:10,072 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-11-22 21:46:10,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-11-22 21:46:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:46:10,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:10,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:10,074 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:10,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-11-22 21:46:10,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:10,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:10,103 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-22 21:46:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:10,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:10,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,104 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-11-22 21:46:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,161 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-11-22 21:46:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:46:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,170 INFO L225 Difference]: With dead ends: 2508 [2018-11-22 21:46:10,170 INFO L226 Difference]: Without dead ends: 2506 [2018-11-22 21:46:10,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-22 21:46:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-11-22 21:46:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-22 21:46:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-11-22 21:46:10,235 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-11-22 21:46:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:10,235 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-11-22 21:46:10,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-11-22 21:46:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:46:10,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:10,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:10,238 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:10,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-11-22 21:46:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:10,271 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-22 21:46:10,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:10,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:10,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:10,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:10,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,272 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-11-22 21:46:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,337 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-11-22 21:46:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:46:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,346 INFO L225 Difference]: With dead ends: 4556 [2018-11-22 21:46:10,347 INFO L226 Difference]: Without dead ends: 2666 [2018-11-22 21:46:10,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-22 21:46:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-11-22 21:46:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-11-22 21:46:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-11-22 21:46:10,454 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-11-22 21:46:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:10,455 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-11-22 21:46:10,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-11-22 21:46:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:46:10,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:10,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:10,458 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:10,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-11-22 21:46:10,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:10,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:10,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:10,490 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-22 21:46:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:10,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:10,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:10,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:10,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,491 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-11-22 21:46:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,541 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-11-22 21:46:10,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:46:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,552 INFO L225 Difference]: With dead ends: 3996 [2018-11-22 21:46:10,553 INFO L226 Difference]: Without dead ends: 2698 [2018-11-22 21:46:10,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-22 21:46:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-11-22 21:46:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-22 21:46:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-11-22 21:46:10,632 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-11-22 21:46:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:10,633 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-11-22 21:46:10,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-11-22 21:46:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:46:10,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:10,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:10,636 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:10,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-11-22 21:46:10,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:10,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:10,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:10,658 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-22 21:46:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:10,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:10,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:10,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:10,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,659 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-11-22 21:46:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,741 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-11-22 21:46:10,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:46:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,755 INFO L225 Difference]: With dead ends: 4876 [2018-11-22 21:46:10,755 INFO L226 Difference]: Without dead ends: 4874 [2018-11-22 21:46:10,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-22 21:46:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-11-22 21:46:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-11-22 21:46:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-11-22 21:46:10,857 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-11-22 21:46:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-11-22 21:46:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-11-22 21:46:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:46:10,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:10,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:10,862 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:10,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-11-22 21:46:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:10,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:10,883 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-22 21:46:10,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:10,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:10,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:10,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:10,884 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-11-22 21:46:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:10,981 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-11-22 21:46:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:10,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:46:10,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:10,997 INFO L225 Difference]: With dead ends: 9036 [2018-11-22 21:46:10,997 INFO L226 Difference]: Without dead ends: 5258 [2018-11-22 21:46:11,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-22 21:46:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-11-22 21:46:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-11-22 21:46:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-11-22 21:46:11,141 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-11-22 21:46:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:11,142 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-11-22 21:46:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-11-22 21:46:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:46:11,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:11,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:11,147 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:11,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-11-22 21:46:11,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:46:11,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:11,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:11,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:11,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:11,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:11,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,175 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-11-22 21:46:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:11,258 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-11-22 21:46:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:11,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:46:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:11,270 INFO L225 Difference]: With dead ends: 7884 [2018-11-22 21:46:11,270 INFO L226 Difference]: Without dead ends: 5322 [2018-11-22 21:46:11,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-11-22 21:46:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-11-22 21:46:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-11-22 21:46:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-11-22 21:46:11,402 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-11-22 21:46:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:11,403 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-11-22 21:46:11,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-11-22 21:46:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:46:11,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:11,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:11,408 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:11,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-11-22 21:46:11,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:46:11,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:11,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:11,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:11,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:11,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,427 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-11-22 21:46:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:11,586 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-11-22 21:46:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:11,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:46:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:11,606 INFO L225 Difference]: With dead ends: 15564 [2018-11-22 21:46:11,607 INFO L226 Difference]: Without dead ends: 10378 [2018-11-22 21:46:11,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-11-22 21:46:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-11-22 21:46:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-22 21:46:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-11-22 21:46:11,879 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-11-22 21:46:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:11,879 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-11-22 21:46:11,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-11-22 21:46:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:46:11,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:11,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:11,888 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:11,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-11-22 21:46:11,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:11,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:11,910 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-22 21:46:11,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:11,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:11,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:11,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:11,911 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-11-22 21:46:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:12,063 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-11-22 21:46:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:12,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:46:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:12,084 INFO L225 Difference]: With dead ends: 12172 [2018-11-22 21:46:12,084 INFO L226 Difference]: Without dead ends: 12170 [2018-11-22 21:46:12,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-22 21:46:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-11-22 21:46:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-22 21:46:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-11-22 21:46:12,300 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-11-22 21:46:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:12,301 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-11-22 21:46:12,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-11-22 21:46:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:46:12,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:12,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:12,310 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:12,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:12,311 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-11-22 21:46:12,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:12,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:12,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:12,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:12,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:12,326 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-22 21:46:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:12,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:12,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:12,327 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-11-22 21:46:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:12,531 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-11-22 21:46:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:12,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-22 21:46:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:12,561 INFO L225 Difference]: With dead ends: 18316 [2018-11-22 21:46:12,561 INFO L226 Difference]: Without dead ends: 18314 [2018-11-22 21:46:12,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-11-22 21:46:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-11-22 21:46:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-11-22 21:46:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-11-22 21:46:12,879 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-11-22 21:46:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:12,879 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-11-22 21:46:12,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-11-22 21:46:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:46:12,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:12,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:12,921 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:12,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-11-22 21:46:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:12,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:12,957 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-22 21:46:12,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:12,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:12,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:12,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:12,958 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-11-22 21:46:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:13,112 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-11-22 21:46:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:13,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-22 21:46:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:13,133 INFO L225 Difference]: With dead ends: 35468 [2018-11-22 21:46:13,133 INFO L226 Difference]: Without dead ends: 20362 [2018-11-22 21:46:13,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-11-22 21:46:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-11-22 21:46:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-11-22 21:46:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-11-22 21:46:13,403 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-11-22 21:46:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:13,404 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-11-22 21:46:13,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-11-22 21:46:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:46:13,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:13,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:13,412 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:13,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-11-22 21:46:13,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:13,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:13,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:13,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:13,433 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-22 21:46:13,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:13,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:13,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:13,435 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-11-22 21:46:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:13,594 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-11-22 21:46:13,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:13,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:46:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:13,611 INFO L225 Difference]: With dead ends: 30732 [2018-11-22 21:46:13,612 INFO L226 Difference]: Without dead ends: 20746 [2018-11-22 21:46:13,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-11-22 21:46:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-11-22 21:46:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-11-22 21:46:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-11-22 21:46:14,014 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-11-22 21:46:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:14,014 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-11-22 21:46:14,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-11-22 21:46:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:46:14,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:14,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:14,023 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:14,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:14,023 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-11-22 21:46:14,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:14,046 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-22 21:46:14,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:14,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:14,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:14,047 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-11-22 21:46:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:14,280 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-11-22 21:46:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:14,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:46:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:14,305 INFO L225 Difference]: With dead ends: 35852 [2018-11-22 21:46:14,306 INFO L226 Difference]: Without dead ends: 35850 [2018-11-22 21:46:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-11-22 21:46:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-11-22 21:46:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-11-22 21:46:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-11-22 21:46:14,849 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-11-22 21:46:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:14,849 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-11-22 21:46:14,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-11-22 21:46:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:46:14,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:14,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:14,863 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:14,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-11-22 21:46:14,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:14,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:14,887 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-22 21:46:14,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:14,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:14,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:14,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:14,888 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-11-22 21:46:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:15,258 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-11-22 21:46:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:15,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:46:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:15,287 INFO L225 Difference]: With dead ends: 70668 [2018-11-22 21:46:15,287 INFO L226 Difference]: Without dead ends: 40458 [2018-11-22 21:46:15,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-11-22 21:46:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-11-22 21:46:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-11-22 21:46:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-11-22 21:46:15,973 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-11-22 21:46:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:15,974 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-11-22 21:46:15,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-11-22 21:46:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 21:46:15,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:15,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:15,991 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:15,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-11-22 21:46:15,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:15,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:15,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:15,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:16,020 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-22 21:46:16,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:16,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:16,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:16,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:16,021 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-11-22 21:46:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:16,345 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-11-22 21:46:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:16,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-22 21:46:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:16,376 INFO L225 Difference]: With dead ends: 60684 [2018-11-22 21:46:16,376 INFO L226 Difference]: Without dead ends: 40970 [2018-11-22 21:46:16,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-11-22 21:46:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-11-22 21:46:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-11-22 21:46:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-11-22 21:46:16,888 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-11-22 21:46:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:16,889 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-11-22 21:46:16,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-11-22 21:46:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 21:46:16,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:16,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:16,911 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:16,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-11-22 21:46:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:16,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:16,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:16,934 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-22 21:46:16,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:16,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:16,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:16,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:16,936 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-11-22 21:46:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:17,734 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-11-22 21:46:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-22 21:46:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:17,780 INFO L225 Difference]: With dead ends: 69644 [2018-11-22 21:46:17,780 INFO L226 Difference]: Without dead ends: 69642 [2018-11-22 21:46:17,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-11-22 21:46:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-11-22 21:46:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-11-22 21:46:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-11-22 21:46:18,479 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-11-22 21:46:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:18,479 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-11-22 21:46:18,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-11-22 21:46:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 21:46:18,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:18,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:18,508 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:18,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-11-22 21:46:18,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:18,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:18,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:18,538 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-22 21:46:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:18,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:18,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:18,539 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-11-22 21:46:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:19,433 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-11-22 21:46:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:19,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-22 21:46:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:19,492 INFO L225 Difference]: With dead ends: 140300 [2018-11-22 21:46:19,492 INFO L226 Difference]: Without dead ends: 79882 [2018-11-22 21:46:19,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-11-22 21:46:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-11-22 21:46:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-11-22 21:46:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-11-22 21:46:20,503 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-11-22 21:46:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:20,503 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-11-22 21:46:20,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:20,504 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-11-22 21:46:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:46:20,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:20,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:20,542 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:20,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-11-22 21:46:20,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:20,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:20,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:20,563 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-22 21:46:20,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:20,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:20,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:20,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:20,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:20,565 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-11-22 21:46:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:21,551 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-11-22 21:46:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:21,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-22 21:46:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:21,612 INFO L225 Difference]: With dead ends: 119820 [2018-11-22 21:46:21,612 INFO L226 Difference]: Without dead ends: 80906 [2018-11-22 21:46:21,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-11-22 21:46:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-11-22 21:46:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-11-22 21:46:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-11-22 21:46:22,597 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-11-22 21:46:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:22,597 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-11-22 21:46:22,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-11-22 21:46:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:46:22,625 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:22,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:22,625 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-11-22 21:46:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:22,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:22,646 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-22 21:46:22,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:22,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:22,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:22,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:22,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:22,647 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-11-22 21:46:23,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:23,899 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-11-22 21:46:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:23,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-22 21:46:23,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:24,007 INFO L225 Difference]: With dead ends: 135180 [2018-11-22 21:46:24,007 INFO L226 Difference]: Without dead ends: 135178 [2018-11-22 21:46:24,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-11-22 21:46:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-11-22 21:46:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-11-22 21:46:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-11-22 21:46:25,859 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-11-22 21:46:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:25,859 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-11-22 21:46:25,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-11-22 21:46:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:46:25,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:25,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:25,915 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:25,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-11-22 21:46:25,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:25,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:25,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:25,946 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-22 21:46:25,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:25,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:25,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:25,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:25,947 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-11-22 21:46:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:27,353 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-11-22 21:46:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:27,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-22 21:46:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:27,485 INFO L225 Difference]: With dead ends: 278540 [2018-11-22 21:46:27,485 INFO L226 Difference]: Without dead ends: 157706 [2018-11-22 21:46:27,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-11-22 21:46:31,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-11-22 21:46:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-11-22 21:46:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-11-22 21:46:31,522 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-11-22 21:46:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:31,522 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-11-22 21:46:31,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-11-22 21:46:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:46:31,582 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:31,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:31,583 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:31,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-11-22 21:46:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:31,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:31,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:31,608 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-22 21:46:31,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:31,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:31,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:31,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:31,609 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-11-22 21:46:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:32,948 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-11-22 21:46:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:32,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-22 21:46:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:33,087 INFO L225 Difference]: With dead ends: 236556 [2018-11-22 21:46:33,087 INFO L226 Difference]: Without dead ends: 159754 [2018-11-22 21:46:33,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-11-22 21:46:35,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-11-22 21:46:35,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-11-22 21:46:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-11-22 21:46:35,849 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-11-22 21:46:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:35,849 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-11-22 21:46:35,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-11-22 21:46:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:46:35,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:35,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:35,911 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:35,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-11-22 21:46:35,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:35,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:35,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:35,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-22 21:46:35,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:35,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:35,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:35,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:35,943 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-11-22 21:46:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:38,238 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-11-22 21:46:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:38,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-22 21:46:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:38,478 INFO L225 Difference]: With dead ends: 262156 [2018-11-22 21:46:38,478 INFO L226 Difference]: Without dead ends: 262154 [2018-11-22 21:46:38,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-11-22 21:46:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-11-22 21:46:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-11-22 21:46:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-11-22 21:46:41,903 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-11-22 21:46:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:41,903 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-11-22 21:46:41,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-11-22 21:46:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:46:42,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:42,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:42,023 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:42,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-11-22 21:46:42,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:42,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:42,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:42,046 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-22 21:46:42,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:42,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:42,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:42,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:42,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:42,047 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-11-22 21:46:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:45,348 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-11-22 21:46:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:45,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-22 21:46:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:45,593 INFO L225 Difference]: With dead ends: 552972 [2018-11-22 21:46:45,593 INFO L226 Difference]: Without dead ends: 311306 [2018-11-22 21:46:45,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-11-22 21:46:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-11-22 21:46:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-11-22 21:46:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-11-22 21:46:53,234 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-11-22 21:46:53,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:46:53,234 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-11-22 21:46:53,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:46:53,234 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-11-22 21:46:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 21:46:53,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:46:53,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:46:53,365 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:46:53,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:46:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-11-22 21:46:53,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:46:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:53,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:46:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:46:53,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:46:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:46:53,391 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-22 21:46:53,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:46:53,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:46:53,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:46:53,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:46:53,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:46:53,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:53,392 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-11-22 21:46:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:46:56,587 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-11-22 21:46:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:46:56,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-22 21:46:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:46:56,849 INFO L225 Difference]: With dead ends: 466956 [2018-11-22 21:46:56,849 INFO L226 Difference]: Without dead ends: 315402 [2018-11-22 21:46:56,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:46:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-11-22 21:47:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-11-22 21:47:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-11-22 21:47:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-11-22 21:47:01,965 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-11-22 21:47:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:47:01,965 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-11-22 21:47:01,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:47:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-11-22 21:47:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 21:47:02,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:47:02,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:47:02,098 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:47:02,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:47:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-11-22 21:47:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:47:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:47:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:02,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:47:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:47:02,123 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-22 21:47:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:47:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:47:02,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:47:02,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:47:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:47:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:47:02,125 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-11-22 21:47:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:47:07,403 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-11-22 21:47:07,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:47:07,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-22 21:47:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:47:07,820 INFO L225 Difference]: With dead ends: 507914 [2018-11-22 21:47:07,820 INFO L226 Difference]: Without dead ends: 507912 [2018-11-22 21:47:07,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:47:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-11-22 21:47:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-11-22 21:47:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-11-22 21:47:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-11-22 21:47:17,005 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-11-22 21:47:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:47:17,005 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-11-22 21:47:17,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:47:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-11-22 21:47:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 21:47:17,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:47:17,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:47:17,260 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:47:17,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:47:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-11-22 21:47:17,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:47:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:47:17,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:47:17,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:47:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:47:17,287 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-22 21:47:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:47:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:47:17,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:47:17,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:47:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:47:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:47:17,289 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-11-22 21:47:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:47:24,723 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-11-22 21:47:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:47:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-22 21:47:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:47:24,724 INFO L225 Difference]: With dead ends: 1097736 [2018-11-22 21:47:24,724 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:47:25,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:47:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:47:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:47:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:47:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:47:25,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-22 21:47:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:47:25,088 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:47:25,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:47:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:47:25,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:47:25,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:47:25,164 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 21:47:25,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:47:25,164 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:47:25,165 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,165 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,166 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-22 21:47:25,167 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-22 21:47:25,168 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-22 21:47:25,170 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-22 21:47:25,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:47:25 BoogieIcfgContainer [2018-11-22 21:47:25,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:47:25,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:47:25,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:47:25,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:47:25,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:08" (3/4) ... [2018-11-22 21:47:25,184 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:47:25,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:47:25,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:47:25,198 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 21:47:25,198 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 21:47:25,199 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:47:25,254 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_308052d0-66d6-49d2-a1e9-d58a301648ef/bin-2019/utaipan/witness.graphml [2018-11-22 21:47:25,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:47:25,255 INFO L168 Benchmark]: Toolchain (without parser) took 77371.91 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.1 GB). Free memory was 958.2 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,257 INFO L168 Benchmark]: CDTParser took 0.21 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-22 21:47:25,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:47:25,258 INFO L168 Benchmark]: Boogie Preprocessor took 63.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,258 INFO L168 Benchmark]: RCFGBuilder took 273.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,258 INFO L168 Benchmark]: TraceAbstraction took 76740.37 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,259 INFO L168 Benchmark]: Witness Printer took 74.47 ms. Allocated memory is still 6.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2018-11-22 21:47:25,265 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.21 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 201.74 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.77 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 273.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76740.37 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 74.47 ms. Allocated memory is still 6.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 76.6s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 33.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 40.2s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...