/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:41,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:41,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:41,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:41,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:41,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:41,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:41,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:41,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:41,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:41,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:41,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:41,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:41,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:41,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:41,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:41,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:41,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:41,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:41,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:41,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:41,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:41,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:41,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:41,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:41,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:41,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:41,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:41,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:41,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:41,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:41,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:41,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:41,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:41,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:41,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:41,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:41,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:41,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:41,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:41,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:41,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:34:41,942 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:41,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:41,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:41,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:41,945 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:41,945 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:41,945 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:41,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:41,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:41,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:41,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:41,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:41,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:41,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:41,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:41,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:41,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:41,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:41,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:41,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:41,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:41,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:41,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:41,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:41,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:41,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:41,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:41,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:41,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:42,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:42,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:42,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:42,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:42,250 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:42,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-11-07 00:34:42,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a88b889/08972831fb51455492dbe026b1343946/FLAGc98bc9ad5 [2019-11-07 00:34:42,857 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:42,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-11-07 00:34:42,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a88b889/08972831fb51455492dbe026b1343946/FLAGc98bc9ad5 [2019-11-07 00:34:43,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a88b889/08972831fb51455492dbe026b1343946 [2019-11-07 00:34:43,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:43,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:43,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:43,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:43,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:43,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b475cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43, skipping insertion in model container [2019-11-07 00:34:43,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,208 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:43,268 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:43,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:43,642 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:43,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:43,823 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:43,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43 WrapperNode [2019-11-07 00:34:43,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:43,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:43,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:43,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:43,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (1/1) ... [2019-11-07 00:34:43,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:43,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:43,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:43,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:43,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (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-11-07 00:34:43,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:43,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:43,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:43,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:44,844 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:44,845 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:34:44,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:44 BoogieIcfgContainer [2019-11-07 00:34:44,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:44,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:44,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:44,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:44,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:43" (1/3) ... [2019-11-07 00:34:44,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49094d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:44, skipping insertion in model container [2019-11-07 00:34:44,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:43" (2/3) ... [2019-11-07 00:34:44,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49094d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:44, skipping insertion in model container [2019-11-07 00:34:44,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:44" (3/3) ... [2019-11-07 00:34:44,855 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-11-07 00:34:44,866 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:44,875 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:34:44,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:34:44,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:44,918 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:44,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:44,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:44,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:44,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:44,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:44,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-07 00:34:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:44,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:44,962 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:44,964 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-11-07 00:34:44,982 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:44,983 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116443607] [2019-11-07 00:34:44,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:45,219 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116443607] [2019-11-07 00:34:45,220 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:45,220 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:45,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049087515] [2019-11-07 00:34:45,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:45,230 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:45,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:45,247 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-11-07 00:34:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:45,789 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2019-11-07 00:34:45,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:45,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-07 00:34:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:45,812 INFO L225 Difference]: With dead ends: 290 [2019-11-07 00:34:45,813 INFO L226 Difference]: Without dead ends: 145 [2019-11-07 00:34:45,821 INFO L630 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-11-07 00:34:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-07 00:34:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-07 00:34:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-07 00:34:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-11-07 00:34:45,913 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-11-07 00:34:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:45,913 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-11-07 00:34:45,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-11-07 00:34:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:45,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:45,930 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:45,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-11-07 00:34:45,932 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:45,932 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350384564] [2019-11-07 00:34:45,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:46,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350384564] [2019-11-07 00:34:46,108 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:46,108 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:46,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263859051] [2019-11-07 00:34:46,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:46,114 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:46,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:46,116 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-11-07 00:34:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:46,693 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2019-11-07 00:34:46,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:46,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-07 00:34:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:46,697 INFO L225 Difference]: With dead ends: 410 [2019-11-07 00:34:46,697 INFO L226 Difference]: Without dead ends: 277 [2019-11-07 00:34:46,698 INFO L630 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-11-07 00:34:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-07 00:34:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-11-07 00:34:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-07 00:34:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-11-07 00:34:46,735 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-11-07 00:34:46,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:46,736 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-11-07 00:34:46,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-11-07 00:34:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:46,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:46,739 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:46,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-11-07 00:34:46,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:46,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583054879] [2019-11-07 00:34:46,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:49,213 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583054879] [2019-11-07 00:34:49,213 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:49,213 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:34:49,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870371608] [2019-11-07 00:34:49,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:34:49,214 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:34:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:49,218 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 69 states. [2019-11-07 00:34:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:49,951 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2019-11-07 00:34:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:49,952 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:34:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:49,954 INFO L225 Difference]: With dead ends: 404 [2019-11-07 00:34:49,954 INFO L226 Difference]: Without dead ends: 269 [2019-11-07 00:34:49,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-07 00:34:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-11-07 00:34:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-07 00:34:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-11-07 00:34:50,001 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-11-07 00:34:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:50,001 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-11-07 00:34:50,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:34:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-11-07 00:34:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:50,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:50,006 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:50,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-11-07 00:34:50,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:50,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650234084] [2019-11-07 00:34:50,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:52,506 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650234084] [2019-11-07 00:34:52,506 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:52,506 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:34:52,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878243728] [2019-11-07 00:34:52,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:34:52,507 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:52,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:34:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:52,511 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 69 states. [2019-11-07 00:34:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:53,578 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2019-11-07 00:34:53,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:34:53,579 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:34:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:53,582 INFO L225 Difference]: With dead ends: 394 [2019-11-07 00:34:53,582 INFO L226 Difference]: Without dead ends: 267 [2019-11-07 00:34:53,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-07 00:34:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-11-07 00:34:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-07 00:34:53,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-11-07 00:34:53,598 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-11-07 00:34:53,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:53,598 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-11-07 00:34:53,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:34:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-11-07 00:34:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:53,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:53,613 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:53,615 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-11-07 00:34:53,615 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:53,616 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128066161] [2019-11-07 00:34:53,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:55,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128066161] [2019-11-07 00:34:55,297 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:55,298 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:34:55,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041395265] [2019-11-07 00:34:55,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:34:55,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:34:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:55,301 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 69 states. [2019-11-07 00:34:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:56,486 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2019-11-07 00:34:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:34:56,487 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:34:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:56,489 INFO L225 Difference]: With dead ends: 390 [2019-11-07 00:34:56,490 INFO L226 Difference]: Without dead ends: 265 [2019-11-07 00:34:56,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-07 00:34:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-11-07 00:34:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-07 00:34:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-11-07 00:34:56,503 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-11-07 00:34:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:56,503 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-11-07 00:34:56,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:34:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-11-07 00:34:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:56,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:56,505 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:56,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-11-07 00:34:56,506 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:56,507 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094177881] [2019-11-07 00:34:56,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:58,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-11-07 00:34:58,424 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094177881] [2019-11-07 00:34:58,424 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:58,424 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:34:58,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477312280] [2019-11-07 00:34:58,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:34:58,425 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:34:58,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:58,427 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 69 states. [2019-11-07 00:34:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:59,702 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2019-11-07 00:34:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 00:34:59,702 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:34:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:59,704 INFO L225 Difference]: With dead ends: 382 [2019-11-07 00:34:59,705 INFO L226 Difference]: Without dead ends: 259 [2019-11-07 00:34:59,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:34:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-07 00:34:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-11-07 00:34:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-07 00:34:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-11-07 00:34:59,716 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-11-07 00:34:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:59,716 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-11-07 00:34:59,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:34:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-11-07 00:34:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:34:59,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:59,718 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:34:59,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-11-07 00:34:59,719 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:59,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554265993] [2019-11-07 00:34:59,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:01,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554265993] [2019-11-07 00:35:01,432 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:01,432 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:35:01,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582860750] [2019-11-07 00:35:01,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:35:01,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:01,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:35:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:01,436 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 69 states. [2019-11-07 00:35:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:02,856 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2019-11-07 00:35:02,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:35:02,862 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:35:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:02,864 INFO L225 Difference]: With dead ends: 372 [2019-11-07 00:35:02,864 INFO L226 Difference]: Without dead ends: 255 [2019-11-07 00:35:02,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-07 00:35:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-11-07 00:35:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-11-07 00:35:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-11-07 00:35:02,875 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-11-07 00:35:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:02,875 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-11-07 00:35:02,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:35:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-11-07 00:35:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:35:02,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:02,877 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:35:02,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-11-07 00:35:02,878 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:02,878 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313476574] [2019-11-07 00:35:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:04,483 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313476574] [2019-11-07 00:35:04,483 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:04,483 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:35:04,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241771021] [2019-11-07 00:35:04,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:35:04,484 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:35:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:04,486 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 69 states. [2019-11-07 00:35:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:05,836 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2019-11-07 00:35:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-07 00:35:05,837 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:35:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:05,839 INFO L225 Difference]: With dead ends: 366 [2019-11-07 00:35:05,839 INFO L226 Difference]: Without dead ends: 253 [2019-11-07 00:35:05,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-07 00:35:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-11-07 00:35:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-07 00:35:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-11-07 00:35:05,849 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-11-07 00:35:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:05,850 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-11-07 00:35:05,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:35:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-11-07 00:35:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:35:05,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:05,852 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:35:05,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-11-07 00:35:05,852 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:05,853 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332338298] [2019-11-07 00:35:05,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:07,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332338298] [2019-11-07 00:35:07,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:07,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:35:07,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79293429] [2019-11-07 00:35:07,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:35:07,708 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:35:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:07,710 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 69 states. [2019-11-07 00:35:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:09,500 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2019-11-07 00:35:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-07 00:35:09,501 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:35:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:09,502 INFO L225 Difference]: With dead ends: 360 [2019-11-07 00:35:09,503 INFO L226 Difference]: Without dead ends: 249 [2019-11-07 00:35:09,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-07 00:35:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-07 00:35:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-07 00:35:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-11-07 00:35:09,512 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-11-07 00:35:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:09,512 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-11-07 00:35:09,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:35:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-11-07 00:35:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:35:09,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:09,514 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:35:09,514 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-11-07 00:35:09,515 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:09,515 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026149789] [2019-11-07 00:35:09,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:11,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026149789] [2019-11-07 00:35:11,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:11,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-11-07 00:35:11,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959178353] [2019-11-07 00:35:11,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-07 00:35:11,033 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:11,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-07 00:35:11,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:11,035 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 69 states. [2019-11-07 00:35:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:13,027 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2019-11-07 00:35:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 00:35:13,027 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-11-07 00:35:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:13,029 INFO L225 Difference]: With dead ends: 352 [2019-11-07 00:35:13,029 INFO L226 Difference]: Without dead ends: 245 [2019-11-07 00:35:13,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-11-07 00:35:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-07 00:35:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-07 00:35:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-07 00:35:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-11-07 00:35:13,038 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-11-07 00:35:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:13,039 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-11-07 00:35:13,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-07 00:35:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-11-07 00:35:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:35:13,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:13,040 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:35:13,041 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-11-07 00:35:13,041 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:13,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332126033] [2019-11-07 00:35:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:15,169 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332126033] [2019-11-07 00:35:15,170 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:15,170 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-11-07 00:35:15,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814025036] [2019-11-07 00:35:15,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-11-07 00:35:15,171 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-11-07 00:35:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-11-07 00:35:15,172 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 70 states. [2019-11-07 00:35:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:21,219 INFO L93 Difference]: Finished difference Result 556 states and 625 transitions. [2019-11-07 00:35:21,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-11-07 00:35:21,219 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-11-07 00:35:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:21,223 INFO L225 Difference]: With dead ends: 556 [2019-11-07 00:35:21,223 INFO L226 Difference]: Without dead ends: 453 [2019-11-07 00:35:21,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-11-07 00:35:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-07 00:35:21,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-11-07 00:35:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-07 00:35:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-11-07 00:35:21,239 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-11-07 00:35:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:21,240 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-11-07 00:35:21,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-11-07 00:35:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-11-07 00:35:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 00:35:21,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:21,242 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:35:21,242 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-11-07 00:35:21,243 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:21,243 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356498456] [2019-11-07 00:35:21,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat