java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:31:50,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:31:50,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:31:50,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:31:50,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:31:50,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:31:50,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:31:50,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:31:50,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:31:50,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:31:50,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:31:50,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:31:50,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:31:50,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:31:50,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:31:50,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:31:50,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:31:50,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:31:50,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:31:50,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:31:50,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:31:50,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:31:50,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:31:50,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:31:50,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:31:50,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:31:50,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:31:50,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:31:50,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:31:50,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:31:50,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:31:50,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:31:50,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:31:50,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:31:50,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:31:50,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:31:50,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:31:50,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:31:50,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:31:50,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:31:50,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:31:50,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:31:50,824 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:31:50,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:31:50,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:31:50,825 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:31:50,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:31:50,826 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:31:50,826 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:31:50,827 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:31:50,827 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:31:50,827 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:31:50,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:31:50,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:31:50,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:31:50,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:31:50,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:31:50,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:31:50,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:31:50,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:31:50,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:31:50,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:31:50,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:31:50,830 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:31:50,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:31:50,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:50,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:31:50,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:31:50,831 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:31:50,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:31:50,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:31:50,832 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:31:50,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:31:50,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:31:50,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:31:50,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:31:50,889 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:31:50,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-09-20 13:31:50,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969e10c12/0b8cc34b79fd45a88752011ff32e8cae/FLAGccf696afb [2019-09-20 13:31:51,434 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:31:51,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-09-20 13:31:51,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969e10c12/0b8cc34b79fd45a88752011ff32e8cae/FLAGccf696afb [2019-09-20 13:31:51,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969e10c12/0b8cc34b79fd45a88752011ff32e8cae [2019-09-20 13:31:51,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:31:51,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:31:51,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:51,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:31:51,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:31:51,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:51" (1/1) ... [2019-09-20 13:31:51,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70362dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:51, skipping insertion in model container [2019-09-20 13:31:51,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:51" (1/1) ... [2019-09-20 13:31:51,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:31:51,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:31:52,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:52,069 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:31:52,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:31:52,220 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:31:52,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52 WrapperNode [2019-09-20 13:31:52,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:52,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:31:52,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:31:52,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:31:52,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... [2019-09-20 13:31:52,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:31:52,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:31:52,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:31:52,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:31:52,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-20 13:31:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-20 13:31:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:31:52,342 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:31:52,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:31:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:31:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:31:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:31:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:31:52,344 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:31:52,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:31:52,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:31:52,829 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:31:52,829 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:31:52,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:52 BoogieIcfgContainer [2019-09-20 13:31:52,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:31:52,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:31:52,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:31:52,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:31:52,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:31:51" (1/3) ... [2019-09-20 13:31:52,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ba7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:52, skipping insertion in model container [2019-09-20 13:31:52,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:52" (2/3) ... [2019-09-20 13:31:52,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ba7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:31:52, skipping insertion in model container [2019-09-20 13:31:52,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:31:52" (3/3) ... [2019-09-20 13:31:52,845 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-09-20 13:31:52,860 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:31:52,867 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:31:52,884 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:31:52,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:31:52,911 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:31:52,911 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:31:52,911 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:31:52,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:31:52,912 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:31:52,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:31:52,912 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:31:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-09-20 13:31:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:31:52,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:52,946 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:52,949 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-09-20 13:31:52,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:53,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:53,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:53,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:53,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:31:53,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:53,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:31:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:31:53,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:31:53,282 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2019-09-20 13:31:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:53,376 INFO L93 Difference]: Finished difference Result 189 states and 240 transitions. [2019-09-20 13:31:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:31:53,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-20 13:31:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:53,405 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:31:53,406 INFO L226 Difference]: Without dead ends: 175 [2019-09-20 13:31:53,409 INFO L636 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 [2019-09-20 13:31:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-20 13:31:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2019-09-20 13:31:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-20 13:31:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2019-09-20 13:31:53,490 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2019-09-20 13:31:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:53,490 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2019-09-20 13:31:53,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:31:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2019-09-20 13:31:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:53,497 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:53,497 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:53,497 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2019-09-20 13:31:53,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:53,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:53,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:53,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:53,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:53,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:53,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:53,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:53,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:53,665 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2019-09-20 13:31:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:53,776 INFO L93 Difference]: Finished difference Result 168 states and 218 transitions. [2019-09-20 13:31:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:53,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:31:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:53,780 INFO L225 Difference]: With dead ends: 168 [2019-09-20 13:31:53,780 INFO L226 Difference]: Without dead ends: 168 [2019-09-20 13:31:53,783 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-20 13:31:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-20 13:31:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 13:31:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 218 transitions. [2019-09-20 13:31:53,808 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 218 transitions. Word has length 66 [2019-09-20 13:31:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:53,808 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 218 transitions. [2019-09-20 13:31:53,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 218 transitions. [2019-09-20 13:31:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:31:53,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:53,813 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:53,813 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:53,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2019-09-20 13:31:53,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:53,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:54,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:54,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:54,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:54,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:54,010 INFO L87 Difference]: Start difference. First operand 168 states and 218 transitions. Second operand 6 states. [2019-09-20 13:31:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:54,707 INFO L93 Difference]: Finished difference Result 388 states and 583 transitions. [2019-09-20 13:31:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:31:54,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-20 13:31:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:54,721 INFO L225 Difference]: With dead ends: 388 [2019-09-20 13:31:54,721 INFO L226 Difference]: Without dead ends: 388 [2019-09-20 13:31:54,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:31:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-20 13:31:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 343. [2019-09-20 13:31:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-20 13:31:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 508 transitions. [2019-09-20 13:31:54,812 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 508 transitions. Word has length 72 [2019-09-20 13:31:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:54,812 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 508 transitions. [2019-09-20 13:31:54,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 508 transitions. [2019-09-20 13:31:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:54,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:54,817 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:54,817 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:54,817 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-09-20 13:31:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:54,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:54,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:54,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:54,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:54,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:54,948 INFO L87 Difference]: Start difference. First operand 343 states and 508 transitions. Second operand 4 states. [2019-09-20 13:31:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,118 INFO L93 Difference]: Finished difference Result 502 states and 713 transitions. [2019-09-20 13:31:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:55,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:31:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,124 INFO L225 Difference]: With dead ends: 502 [2019-09-20 13:31:55,125 INFO L226 Difference]: Without dead ends: 502 [2019-09-20 13:31:55,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-20 13:31:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 494. [2019-09-20 13:31:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-20 13:31:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 703 transitions. [2019-09-20 13:31:55,157 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 703 transitions. Word has length 66 [2019-09-20 13:31:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,158 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 703 transitions. [2019-09-20 13:31:55,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 703 transitions. [2019-09-20 13:31:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:55,161 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,161 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,162 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-09-20 13:31:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:55,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:55,274 INFO L87 Difference]: Start difference. First operand 494 states and 703 transitions. Second operand 6 states. [2019-09-20 13:31:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,313 INFO L93 Difference]: Finished difference Result 504 states and 711 transitions. [2019-09-20 13:31:55,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:55,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-20 13:31:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,318 INFO L225 Difference]: With dead ends: 504 [2019-09-20 13:31:55,318 INFO L226 Difference]: Without dead ends: 504 [2019-09-20 13:31:55,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-20 13:31:55,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-09-20 13:31:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-20 13:31:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 711 transitions. [2019-09-20 13:31:55,345 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 711 transitions. Word has length 66 [2019-09-20 13:31:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,346 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 711 transitions. [2019-09-20 13:31:55,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 711 transitions. [2019-09-20 13:31:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:55,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,348 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,348 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-09-20 13:31:55,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:55,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:55,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:55,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:55,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:55,426 INFO L87 Difference]: Start difference. First operand 504 states and 711 transitions. Second operand 6 states. [2019-09-20 13:31:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:55,906 INFO L93 Difference]: Finished difference Result 826 states and 1104 transitions. [2019-09-20 13:31:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:31:55,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-20 13:31:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:55,915 INFO L225 Difference]: With dead ends: 826 [2019-09-20 13:31:55,915 INFO L226 Difference]: Without dead ends: 826 [2019-09-20 13:31:55,916 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:31:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-09-20 13:31:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 795. [2019-09-20 13:31:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-20 13:31:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1062 transitions. [2019-09-20 13:31:55,971 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1062 transitions. Word has length 66 [2019-09-20 13:31:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:55,973 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1062 transitions. [2019-09-20 13:31:55,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1062 transitions. [2019-09-20 13:31:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:55,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:55,977 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:55,978 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-09-20 13:31:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:55,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:56,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:56,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:31:56,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:56,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:31:56,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:31:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:31:56,097 INFO L87 Difference]: Start difference. First operand 795 states and 1062 transitions. Second operand 6 states. [2019-09-20 13:31:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,150 INFO L93 Difference]: Finished difference Result 834 states and 1100 transitions. [2019-09-20 13:31:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:31:56,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-09-20 13:31:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:56,187 INFO L225 Difference]: With dead ends: 834 [2019-09-20 13:31:56,187 INFO L226 Difference]: Without dead ends: 834 [2019-09-20 13:31:56,188 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:31:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-09-20 13:31:56,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 822. [2019-09-20 13:31:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-09-20 13:31:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1084 transitions. [2019-09-20 13:31:56,236 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1084 transitions. Word has length 66 [2019-09-20 13:31:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:56,237 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1084 transitions. [2019-09-20 13:31:56,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:31:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1084 transitions. [2019-09-20 13:31:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:31:56,241 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:56,241 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:56,241 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-09-20 13:31:56,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:56,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:31:56,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:56,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:31:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:31:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:31:56,389 INFO L87 Difference]: Start difference. First operand 822 states and 1084 transitions. Second operand 4 states. [2019-09-20 13:31:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,520 INFO L93 Difference]: Finished difference Result 1119 states and 1502 transitions. [2019-09-20 13:31:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:31:56,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:31:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:56,531 INFO L225 Difference]: With dead ends: 1119 [2019-09-20 13:31:56,531 INFO L226 Difference]: Without dead ends: 1119 [2019-09-20 13:31:56,532 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:31:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-20 13:31:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1010. [2019-09-20 13:31:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-09-20 13:31:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1370 transitions. [2019-09-20 13:31:56,596 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1370 transitions. Word has length 66 [2019-09-20 13:31:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:56,597 INFO L475 AbstractCegarLoop]: Abstraction has 1010 states and 1370 transitions. [2019-09-20 13:31:56,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:31:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1370 transitions. [2019-09-20 13:31:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:31:56,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:56,600 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:56,600 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-09-20 13:31:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:31:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:31:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:31:56,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:56,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:31:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:31:56,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:31:56,686 INFO L87 Difference]: Start difference. First operand 1010 states and 1370 transitions. Second operand 3 states. [2019-09-20 13:31:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:31:56,715 INFO L93 Difference]: Finished difference Result 841 states and 1096 transitions. [2019-09-20 13:31:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:31:56,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-20 13:31:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:31:56,721 INFO L225 Difference]: With dead ends: 841 [2019-09-20 13:31:56,721 INFO L226 Difference]: Without dead ends: 841 [2019-09-20 13:31:56,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:31:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-09-20 13:31:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 727. [2019-09-20 13:31:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-09-20 13:31:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 920 transitions. [2019-09-20 13:31:56,754 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 920 transitions. Word has length 67 [2019-09-20 13:31:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:31:56,755 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 920 transitions. [2019-09-20 13:31:56,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:31:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 920 transitions. [2019-09-20 13:31:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:31:56,763 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:31:56,763 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:31:56,763 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:31:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-09-20 13:31:56,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:31:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:31:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:31:56,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:31:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:31:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:31:56,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:31:56,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:31:56,839 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2019-09-20 13:31:56,842 INFO L207 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [66], [69], [71], [76], [79], [82], [86], [87], [88], [89], [98], [101], [104], [110], [116], [123], [126], [149], [152], [155], [163], [164], [165], [175], [177], [193], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [248], [258], [259], [260], [261], [262], [263], [267], [268], [269], [270], [271], [272], [275], [276], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2019-09-20 13:31:56,913 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:31:56,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:31:57,073 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:31:57,076 INFO L272 AbstractInterpreter]: Visited 42 different actions 54 times. Merged at 7 different actions 7 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 4. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2019-09-20 13:31:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:31:57,081 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:31:57,274 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 70.52% of their original sizes. [2019-09-20 13:31:57,274 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:31:57,778 INFO L420 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2019-09-20 13:31:57,778 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:31:57,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:31:57,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2019-09-20 13:31:57,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:31:57,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-20 13:31:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-20 13:31:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-09-20 13:31:57,781 INFO L87 Difference]: Start difference. First operand 727 states and 920 transitions. Second operand 25 states. [2019-09-20 13:32:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:00,310 INFO L93 Difference]: Finished difference Result 629 states and 791 transitions. [2019-09-20 13:32:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:32:00,311 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-20 13:32:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:00,314 INFO L225 Difference]: With dead ends: 629 [2019-09-20 13:32:00,315 INFO L226 Difference]: Without dead ends: 629 [2019-09-20 13:32:00,316 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2019-09-20 13:32:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-20 13:32:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 615. [2019-09-20 13:32:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-20 13:32:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 774 transitions. [2019-09-20 13:32:00,340 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 774 transitions. Word has length 87 [2019-09-20 13:32:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:00,341 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 774 transitions. [2019-09-20 13:32:00,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-20 13:32:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 774 transitions. [2019-09-20 13:32:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-20 13:32:00,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:00,343 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:00,344 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-09-20 13:32:00,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:00,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:32:00,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:00,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:00,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-20 13:32:00,468 INFO L207 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [84], [86], [87], [88], [89], [98], [101], [104], [110], [113], [123], [126], [149], [159], [161], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [228], [236], [238], [240], [243], [248], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2019-09-20 13:32:00,471 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:00,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:00,499 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:00,500 INFO L272 AbstractInterpreter]: Visited 79 different actions 103 times. Merged at 2 different actions 2 times. Never widened. Performed 372 root evaluator evaluations with a maximum evaluation depth of 4. Performed 372 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2019-09-20 13:32:00,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:00,500 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:00,567 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 79.53% of their original sizes. [2019-09-20 13:32:00,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:01,483 INFO L420 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2019-09-20 13:32:01,484 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:01,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [6] total 45 [2019-09-20 13:32:01,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:01,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-20 13:32:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-20 13:32:01,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2019-09-20 13:32:01,487 INFO L87 Difference]: Start difference. First operand 615 states and 774 transitions. Second operand 41 states. [2019-09-20 13:32:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:09,129 INFO L93 Difference]: Finished difference Result 825 states and 1050 transitions. [2019-09-20 13:32:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-20 13:32:09,130 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2019-09-20 13:32:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:09,136 INFO L225 Difference]: With dead ends: 825 [2019-09-20 13:32:09,136 INFO L226 Difference]: Without dead ends: 825 [2019-09-20 13:32:09,138 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=415, Invalid=4141, Unknown=0, NotChecked=0, Total=4556 [2019-09-20 13:32:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-09-20 13:32:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 768. [2019-09-20 13:32:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-09-20 13:32:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 976 transitions. [2019-09-20 13:32:09,165 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 976 transitions. Word has length 99 [2019-09-20 13:32:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:09,165 INFO L475 AbstractCegarLoop]: Abstraction has 768 states and 976 transitions. [2019-09-20 13:32:09,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-20 13:32:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 976 transitions. [2019-09-20 13:32:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:32:09,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:09,169 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:09,169 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -606762632, now seen corresponding path program 1 times [2019-09-20 13:32:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-20 13:32:09,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:09,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:09,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-20 13:32:09,313 INFO L207 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [86], [87], [88], [89], [98], [101], [104], [110], [113], [116], [123], [126], [149], [152], [155], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [276], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2019-09-20 13:32:09,318 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:09,318 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:09,574 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:09,575 INFO L272 AbstractInterpreter]: Visited 81 different actions 526 times. Merged at 25 different actions 94 times. Never widened. Performed 3153 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3153 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 3 different actions. Largest state had 36 variables. [2019-09-20 13:32:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:09,575 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:09,696 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 77.57% of their original sizes. [2019-09-20 13:32:09,696 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:11,248 INFO L420 sIntCurrentIteration]: We unified 118 AI predicates to 118 [2019-09-20 13:32:11,248 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:11,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:11,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [8] total 59 [2019-09-20 13:32:11,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-20 13:32:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-20 13:32:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2514, Unknown=0, NotChecked=0, Total=2756 [2019-09-20 13:32:11,251 INFO L87 Difference]: Start difference. First operand 768 states and 976 transitions. Second operand 53 states.