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-f4eb214f-m [2019-10-13 21:06:30,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:06:30,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:06:30,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:06:30,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:06:30,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:06:30,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:06:30,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:06:30,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:06:30,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:06:30,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:06:30,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:06:30,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:06:30,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:06:30,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:06:30,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:06:30,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:06:30,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:06:30,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:06:30,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:06:30,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:06:30,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:06:30,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:06:30,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:06:30,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:06:30,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:06:30,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:06:30,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:06:30,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:06:30,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:06:30,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:06:30,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:06:30,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:06:30,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:06:30,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:06:30,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:06:30,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:06:30,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:06:30,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:06:30,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:06:30,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:06:30,941 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-10-13 21:06:30,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:06:30,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:06:30,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:06:30,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:06:30,960 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:06:30,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:06:30,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:06:30,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:06:30,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:06:30,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:06:30,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:06:30,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:06:30,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:06:30,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:06:30,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:06:30,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:06:30,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:06:30,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:06:30,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:06:30,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:06:30,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:06:30,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:06:30,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:06:30,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:06:30,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:06:30,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:06:30,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:06:30,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:06:30,965 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-10-13 21:06:31,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:06:31,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:06:31,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:06:31,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:06:31,259 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:06:31,260 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-10-13 21:06:31,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70f9f52e/7a50f6cde78a4391a048cc355bc3e314/FLAGa263b3228 [2019-10-13 21:06:31,873 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:06:31,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-13 21:06:31,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70f9f52e/7a50f6cde78a4391a048cc355bc3e314/FLAGa263b3228 [2019-10-13 21:06:32,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a70f9f52e/7a50f6cde78a4391a048cc355bc3e314 [2019-10-13 21:06:32,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:06:32,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:06:32,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:32,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:06:32,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:06:32,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7672446e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32, skipping insertion in model container [2019-10-13 21:06:32,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,248 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:06:32,295 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:06:32,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:32,654 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:06:32,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:32,827 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:06:32,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32 WrapperNode [2019-10-13 21:06:32,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:32,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:06:32,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:06:32,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:06:32,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (1/1) ... [2019-10-13 21:06:32,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:06:32,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:06:32,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:06:32,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:06:32,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (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-10-13 21:06:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:06:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:06:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:06:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:06:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:06:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:06:32,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:06:32,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:06:32,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:06:32,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:06:33,774 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:06:33,775 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:06:33,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:33 BoogieIcfgContainer [2019-10-13 21:06:33,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:06:33,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:06:33,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:06:33,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:06:33,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:32" (1/3) ... [2019-10-13 21:06:33,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e1d3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:33, skipping insertion in model container [2019-10-13 21:06:33,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:32" (2/3) ... [2019-10-13 21:06:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e1d3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:33, skipping insertion in model container [2019-10-13 21:06:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:33" (3/3) ... [2019-10-13 21:06:33,785 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-10-13 21:06:33,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:06:33,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:06:33,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:06:33,842 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:06:33,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:06:33,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:06:33,843 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:06:33,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:06:33,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:06:33,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:06:33,844 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:06:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 21:06:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:33,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:33,884 INFO L380 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-10-13 21:06:33,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:33,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:33,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-10-13 21:06:33,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:33,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941421523] [2019-10-13 21:06:33,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:33,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:34,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941421523] [2019-10-13 21:06:34,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:34,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:34,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615643185] [2019-10-13 21:06:34,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:34,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:34,170 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-10-13 21:06:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:34,654 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2019-10-13 21:06:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:34,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-13 21:06:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:34,675 INFO L225 Difference]: With dead ends: 290 [2019-10-13 21:06:34,675 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 21:06:34,683 INFO L600 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-10-13 21:06:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 21:06:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-10-13 21:06:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-13 21:06:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-13 21:06:34,768 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-10-13 21:06:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:34,768 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-13 21:06:34,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-13 21:06:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:34,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:34,783 INFO L380 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-10-13 21:06:34,784 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:34,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-10-13 21:06:34,786 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:34,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612632718] [2019-10-13 21:06:34,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:34,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:34,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:34,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612632718] [2019-10-13 21:06:34,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:34,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:06:34,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622127343] [2019-10-13 21:06:34,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:06:34,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:06:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:06:34,933 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-13 21:06:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:35,539 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2019-10-13 21:06:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:06:35,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-13 21:06:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:35,551 INFO L225 Difference]: With dead ends: 410 [2019-10-13 21:06:35,551 INFO L226 Difference]: Without dead ends: 277 [2019-10-13 21:06:35,553 INFO L600 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-10-13 21:06:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-13 21:06:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-10-13 21:06:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-13 21:06:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-10-13 21:06:35,577 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-10-13 21:06:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:35,578 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-10-13 21:06:35,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:06:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-10-13 21:06:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:35,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:35,581 INFO L380 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-10-13 21:06:35,581 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-10-13 21:06:35,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:35,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71996607] [2019-10-13 21:06:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:35,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:35,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:38,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71996607] [2019-10-13 21:06:38,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:38,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:38,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155701277] [2019-10-13 21:06:38,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:38,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:38,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:38,230 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 69 states. [2019-10-13 21:06:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:39,053 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2019-10-13 21:06:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:06:39,055 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:39,057 INFO L225 Difference]: With dead ends: 404 [2019-10-13 21:06:39,057 INFO L226 Difference]: Without dead ends: 269 [2019-10-13 21:06:39,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-13 21:06:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-10-13 21:06:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-13 21:06:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-10-13 21:06:39,094 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-10-13 21:06:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:39,095 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-10-13 21:06:39,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-10-13 21:06:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:39,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:39,103 INFO L380 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-10-13 21:06:39,104 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-10-13 21:06:39,105 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:39,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723678938] [2019-10-13 21:06:39,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:39,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:41,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723678938] [2019-10-13 21:06:41,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:41,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:41,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179396217] [2019-10-13 21:06:41,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:41,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:41,481 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 69 states. [2019-10-13 21:06:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:42,645 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2019-10-13 21:06:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:06:42,646 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:42,649 INFO L225 Difference]: With dead ends: 394 [2019-10-13 21:06:42,649 INFO L226 Difference]: Without dead ends: 267 [2019-10-13 21:06:42,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-13 21:06:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-10-13 21:06:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 21:06:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-10-13 21:06:42,666 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-10-13 21:06:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:42,666 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-10-13 21:06:42,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-10-13 21:06:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:42,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:42,669 INFO L380 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-10-13 21:06:42,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-10-13 21:06:42,670 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:42,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181544742] [2019-10-13 21:06:42,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:42,670 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:44,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-10-13 21:06:44,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181544742] [2019-10-13 21:06:44,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:44,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:44,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674889430] [2019-10-13 21:06:44,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:44,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:44,390 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 69 states. [2019-10-13 21:06:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:45,591 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2019-10-13 21:06:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:06:45,597 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:45,599 INFO L225 Difference]: With dead ends: 390 [2019-10-13 21:06:45,599 INFO L226 Difference]: Without dead ends: 265 [2019-10-13 21:06:45,601 INFO L600 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-10-13 21:06:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-13 21:06:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-10-13 21:06:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-13 21:06:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-10-13 21:06:45,613 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-10-13 21:06:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:45,614 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-10-13 21:06:45,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-10-13 21:06:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:45,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:45,616 INFO L380 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-10-13 21:06:45,616 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-10-13 21:06:45,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:45,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230875280] [2019-10-13 21:06:45,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:45,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:45,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:47,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230875280] [2019-10-13 21:06:47,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:47,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:47,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144693757] [2019-10-13 21:06:47,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:47,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:47,270 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 69 states. [2019-10-13 21:06:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:48,666 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2019-10-13 21:06:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:06:48,667 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:48,669 INFO L225 Difference]: With dead ends: 382 [2019-10-13 21:06:48,669 INFO L226 Difference]: Without dead ends: 259 [2019-10-13 21:06:48,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-13 21:06:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-13 21:06:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-13 21:06:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-10-13 21:06:48,681 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-10-13 21:06:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:48,682 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-10-13 21:06:48,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-10-13 21:06:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:48,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:48,684 INFO L380 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-10-13 21:06:48,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-10-13 21:06:48,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:48,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926666527] [2019-10-13 21:06:48,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:48,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:48,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:50,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926666527] [2019-10-13 21:06:50,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:50,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:50,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322460747] [2019-10-13 21:06:50,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:50,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:50,320 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 69 states. [2019-10-13 21:06:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:51,814 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2019-10-13 21:06:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:06:51,814 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:51,817 INFO L225 Difference]: With dead ends: 372 [2019-10-13 21:06:51,817 INFO L226 Difference]: Without dead ends: 255 [2019-10-13 21:06:51,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-13 21:06:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-10-13 21:06:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-13 21:06:51,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-10-13 21:06:51,828 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-10-13 21:06:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:51,828 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-10-13 21:06:51,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-10-13 21:06:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:51,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:51,831 INFO L380 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-10-13 21:06:51,831 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-10-13 21:06:51,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:51,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098583134] [2019-10-13 21:06:51,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:51,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:51,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:53,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098583134] [2019-10-13 21:06:53,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:53,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:53,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872753875] [2019-10-13 21:06:53,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:53,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:53,454 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 69 states. [2019-10-13 21:06:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:54,801 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2019-10-13 21:06:54,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:06:54,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:54,804 INFO L225 Difference]: With dead ends: 366 [2019-10-13 21:06:54,804 INFO L226 Difference]: Without dead ends: 253 [2019-10-13 21:06:54,806 INFO L600 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-10-13 21:06:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-13 21:06:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-10-13 21:06:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-13 21:06:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-10-13 21:06:54,813 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-10-13 21:06:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:54,814 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-10-13 21:06:54,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-10-13 21:06:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:54,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:54,816 INFO L380 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-10-13 21:06:54,816 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-10-13 21:06:54,817 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:54,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372552093] [2019-10-13 21:06:54,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:54,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:54,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:56,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372552093] [2019-10-13 21:06:56,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:56,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:56,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319350124] [2019-10-13 21:06:56,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:56,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:56,462 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 69 states. [2019-10-13 21:06:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:58,265 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2019-10-13 21:06:58,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:06:58,265 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:06:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:58,267 INFO L225 Difference]: With dead ends: 360 [2019-10-13 21:06:58,268 INFO L226 Difference]: Without dead ends: 249 [2019-10-13 21:06:58,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-13 21:06:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-10-13 21:06:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-13 21:06:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-10-13 21:06:58,277 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-10-13 21:06:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:58,277 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-10-13 21:06:58,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:06:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-10-13 21:06:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:06:58,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:58,279 INFO L380 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-10-13 21:06:58,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-10-13 21:06:58,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:58,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123479493] [2019-10-13 21:06:58,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:58,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:58,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:59,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123479493] [2019-10-13 21:06:59,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:59,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-13 21:06:59,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128343223] [2019-10-13 21:06:59,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:06:59,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:59,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:06:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:06:59,836 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 69 states. [2019-10-13 21:07:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:01,724 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2019-10-13 21:07:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:07:01,725 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-13 21:07:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:01,727 INFO L225 Difference]: With dead ends: 352 [2019-10-13 21:07:01,727 INFO L226 Difference]: Without dead ends: 245 [2019-10-13 21:07:01,728 INFO L600 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-10-13 21:07:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-13 21:07:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-13 21:07:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-13 21:07:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-10-13 21:07:01,735 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-10-13 21:07:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:01,735 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-10-13 21:07:01,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:07:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-10-13 21:07:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:07:01,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:01,738 INFO L380 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-10-13 21:07:01,738 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-10-13 21:07:01,738 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:01,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635669878] [2019-10-13 21:07:01,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:01,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:01,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:07:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:07:04,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635669878] [2019-10-13 21:07:04,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:07:04,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-10-13 21:07:04,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373717806] [2019-10-13 21:07:04,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-13 21:07:04,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:07:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-13 21:07:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 21:07:04,072 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 70 states. [2019-10-13 21:07:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:10,261 INFO L93 Difference]: Finished difference Result 556 states and 625 transitions. [2019-10-13 21:07:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-13 21:07:10,262 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-10-13 21:07:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:10,265 INFO L225 Difference]: With dead ends: 556 [2019-10-13 21:07:10,265 INFO L226 Difference]: Without dead ends: 453 [2019-10-13 21:07:10,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-13 21:07:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-13 21:07:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-13 21:07:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-13 21:07:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-10-13 21:07:10,280 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-10-13 21:07:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:10,280 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-10-13 21:07:10,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-13 21:07:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-10-13 21:07:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:07:10,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:07:10,282 INFO L380 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-10-13 21:07:10,283 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:07:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:07:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-10-13 21:07:10,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:07:10,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323119020] [2019-10-13 21:07:10,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:10,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:07:10,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:07:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat