java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 19:34:18,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 19:34:18,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 19:34:18,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 19:34:18,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 19:34:18,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 19:34:18,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 19:34:18,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 19:34:18,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 19:34:18,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 19:34:18,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 19:34:18,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 19:34:18,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 19:34:18,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 19:34:18,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 19:34:18,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 19:34:18,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 19:34:18,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 19:34:18,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 19:34:18,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 19:34:18,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 19:34:18,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 19:34:18,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 19:34:18,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 19:34:18,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 19:34:18,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 19:34:18,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 19:34:18,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 19:34:18,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 19:34:18,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 19:34:18,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 19:34:18,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 19:34:18,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 19:34:18,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 19:34:18,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 19:34:18,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 19:34:18,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 19:34:18,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 19:34:18,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 19:34:18,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 19:34:18,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 19:34:18,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 19:34:18,962 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 19:34:18,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 19:34:18,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 19:34:18,963 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 19:34:18,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 19:34:18,966 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 19:34:18,966 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 19:34:18,966 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 19:34:18,967 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 19:34:18,967 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 19:34:18,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 19:34:18,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 19:34:18,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 19:34:18,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 19:34:18,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 19:34:18,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 19:34:18,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 19:34:18,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 19:34:18,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 19:34:18,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 19:34:18,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 19:34:18,970 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 19:34:18,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 19:34:18,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 19:34:18,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 19:34:18,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 19:34:18,973 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 19:34:18,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 19:34:18,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 19:34:18,973 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 19:34:19,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 19:34:19,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 19:34:19,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 19:34:19,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 19:34:19,033 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 19:34:19,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-09-09 19:34:19,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4e1345b/e81cf9098857442c91857f722b3caeba/FLAG5520dca16 [2019-09-09 19:34:19,787 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 19:34:19,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label49.c [2019-09-09 19:34:19,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4e1345b/e81cf9098857442c91857f722b3caeba/FLAG5520dca16 [2019-09-09 19:34:19,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4e1345b/e81cf9098857442c91857f722b3caeba [2019-09-09 19:34:19,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 19:34:19,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 19:34:19,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 19:34:19,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 19:34:19,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 19:34:19,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:34:19" (1/1) ... [2019-09-09 19:34:19,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19de7cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:19, skipping insertion in model container [2019-09-09 19:34:19,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 07:34:19" (1/1) ... [2019-09-09 19:34:19,947 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 19:34:20,027 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 19:34:20,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 19:34:20,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 19:34:21,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 19:34:21,345 INFO L192 MainTranslator]: Completed translation [2019-09-09 19:34:21,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21 WrapperNode [2019-09-09 19:34:21,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 19:34:21,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 19:34:21,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 19:34:21,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 19:34:21,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... [2019-09-09 19:34:21,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 19:34:21,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 19:34:21,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 19:34:21,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 19:34:21,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 19:34:21,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 19:34:21,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 19:34:21,647 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 19:34:21,648 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-09 19:34:21,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 19:34:21,648 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 19:34:21,648 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-09 19:34:21,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 19:34:21,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 19:34:21,649 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 19:34:21,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 19:34:21,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 19:34:21,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 19:34:25,565 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 19:34:25,565 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 19:34:25,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:34:25 BoogieIcfgContainer [2019-09-09 19:34:25,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 19:34:25,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 19:34:25,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 19:34:25,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 19:34:25,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 07:34:19" (1/3) ... [2019-09-09 19:34:25,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4daf6d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:34:25, skipping insertion in model container [2019-09-09 19:34:25,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 07:34:21" (2/3) ... [2019-09-09 19:34:25,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4daf6d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 07:34:25, skipping insertion in model container [2019-09-09 19:34:25,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 07:34:25" (3/3) ... [2019-09-09 19:34:25,574 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label49.c [2019-09-09 19:34:25,584 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 19:34:25,592 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 19:34:25,608 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 19:34:25,634 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 19:34:25,635 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 19:34:25,635 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 19:34:25,635 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 19:34:25,635 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 19:34:25,635 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 19:34:25,635 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 19:34:25,635 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 19:34:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-09 19:34:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 19:34:25,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:25,680 INFO L399 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] [2019-09-09 19:34:25,682 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1661413296, now seen corresponding path program 1 times [2019-09-09 19:34:25,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:25,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:25,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:25,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:26,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:26,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 19:34:26,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:26,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 19:34:26,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 19:34:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:26,062 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-09 19:34:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:30,954 INFO L93 Difference]: Finished difference Result 1115 states and 1741 transitions. [2019-09-09 19:34:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 19:34:30,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 19:34:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:30,987 INFO L225 Difference]: With dead ends: 1115 [2019-09-09 19:34:30,987 INFO L226 Difference]: Without dead ends: 1028 [2019-09-09 19:34:30,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-09-09 19:34:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 700. [2019-09-09 19:34:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-09-09 19:34:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1110 transitions. [2019-09-09 19:34:31,084 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1110 transitions. Word has length 58 [2019-09-09 19:34:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:31,084 INFO L475 AbstractCegarLoop]: Abstraction has 700 states and 1110 transitions. [2019-09-09 19:34:31,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 19:34:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1110 transitions. [2019-09-09 19:34:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 19:34:31,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:31,091 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:31,092 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1221807989, now seen corresponding path program 1 times [2019-09-09 19:34:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:31,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:31,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:31,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:31,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 19:34:31,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:31,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 19:34:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 19:34:31,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 19:34:31,311 INFO L87 Difference]: Start difference. First operand 700 states and 1110 transitions. Second operand 5 states. [2019-09-09 19:34:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:35,920 INFO L93 Difference]: Finished difference Result 1363 states and 1890 transitions. [2019-09-09 19:34:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 19:34:35,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-09 19:34:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:35,932 INFO L225 Difference]: With dead ends: 1363 [2019-09-09 19:34:35,932 INFO L226 Difference]: Without dead ends: 1363 [2019-09-09 19:34:35,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 19:34:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-09-09 19:34:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1333. [2019-09-09 19:34:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-09-09 19:34:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1846 transitions. [2019-09-09 19:34:35,987 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1846 transitions. Word has length 130 [2019-09-09 19:34:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:35,988 INFO L475 AbstractCegarLoop]: Abstraction has 1333 states and 1846 transitions. [2019-09-09 19:34:35,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 19:34:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1846 transitions. [2019-09-09 19:34:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-09 19:34:35,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:35,991 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:35,991 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash -78025861, now seen corresponding path program 1 times [2019-09-09 19:34:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:35,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:35,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:35,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 19:34:36,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:36,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 19:34:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 19:34:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:36,122 INFO L87 Difference]: Start difference. First operand 1333 states and 1846 transitions. Second operand 4 states. [2019-09-09 19:34:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:40,734 INFO L93 Difference]: Finished difference Result 3822 states and 4963 transitions. [2019-09-09 19:34:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 19:34:40,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-09 19:34:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:40,759 INFO L225 Difference]: With dead ends: 3822 [2019-09-09 19:34:40,759 INFO L226 Difference]: Without dead ends: 3822 [2019-09-09 19:34:40,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-09-09 19:34:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3819. [2019-09-09 19:34:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3819 states. [2019-09-09 19:34:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4957 transitions. [2019-09-09 19:34:40,870 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4957 transitions. Word has length 138 [2019-09-09 19:34:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:40,871 INFO L475 AbstractCegarLoop]: Abstraction has 3819 states and 4957 transitions. [2019-09-09 19:34:40,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 19:34:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4957 transitions. [2019-09-09 19:34:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-09 19:34:40,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:40,875 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:40,875 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:40,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash 90955185, now seen corresponding path program 1 times [2019-09-09 19:34:40,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:40,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:40,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:40,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:40,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:41,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:41,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 19:34:41,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:41,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 19:34:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 19:34:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 19:34:41,091 INFO L87 Difference]: Start difference. First operand 3819 states and 4957 transitions. Second operand 6 states. [2019-09-09 19:34:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:44,476 INFO L93 Difference]: Finished difference Result 3899 states and 4936 transitions. [2019-09-09 19:34:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 19:34:44,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-09 19:34:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:44,499 INFO L225 Difference]: With dead ends: 3899 [2019-09-09 19:34:44,500 INFO L226 Difference]: Without dead ends: 3899 [2019-09-09 19:34:44,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 19:34:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-09-09 19:34:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3889. [2019-09-09 19:34:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3889 states. [2019-09-09 19:34:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 4912 transitions. [2019-09-09 19:34:44,587 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 4912 transitions. Word has length 144 [2019-09-09 19:34:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:44,588 INFO L475 AbstractCegarLoop]: Abstraction has 3889 states and 4912 transitions. [2019-09-09 19:34:44,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 19:34:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 4912 transitions. [2019-09-09 19:34:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-09 19:34:44,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:44,591 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:44,592 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:44,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:44,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2025648949, now seen corresponding path program 1 times [2019-09-09 19:34:44,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:44,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:44,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:44,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:44,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:44,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:44,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 19:34:44,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:44,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 19:34:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 19:34:44,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:44,785 INFO L87 Difference]: Start difference. First operand 3889 states and 4912 transitions. Second operand 4 states. [2019-09-09 19:34:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:49,312 INFO L93 Difference]: Finished difference Result 7692 states and 10105 transitions. [2019-09-09 19:34:49,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 19:34:49,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-09 19:34:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:49,351 INFO L225 Difference]: With dead ends: 7692 [2019-09-09 19:34:49,352 INFO L226 Difference]: Without dead ends: 7692 [2019-09-09 19:34:49,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2019-09-09 19:34:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 7678. [2019-09-09 19:34:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7678 states. [2019-09-09 19:34:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 10066 transitions. [2019-09-09 19:34:49,569 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 10066 transitions. Word has length 169 [2019-09-09 19:34:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:49,570 INFO L475 AbstractCegarLoop]: Abstraction has 7678 states and 10066 transitions. [2019-09-09 19:34:49,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 19:34:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 10066 transitions. [2019-09-09 19:34:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-09 19:34:49,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:49,574 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:49,575 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash 484630862, now seen corresponding path program 1 times [2019-09-09 19:34:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:49,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:49,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:49,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:49,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 19:34:49,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 19:34:49,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 19:34:49,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:34:49,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 19:34:49,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 19:34:49,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:49,766 INFO L87 Difference]: Start difference. First operand 7678 states and 10066 transitions. Second operand 4 states. [2019-09-09 19:34:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:34:53,584 INFO L93 Difference]: Finished difference Result 17579 states and 22205 transitions. [2019-09-09 19:34:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 19:34:53,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-09-09 19:34:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:34:53,637 INFO L225 Difference]: With dead ends: 17579 [2019-09-09 19:34:53,637 INFO L226 Difference]: Without dead ends: 14755 [2019-09-09 19:34:53,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 19:34:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14755 states. [2019-09-09 19:34:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14755 to 14444. [2019-09-09 19:34:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14444 states. [2019-09-09 19:34:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 17173 transitions. [2019-09-09 19:34:53,993 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 17173 transitions. Word has length 214 [2019-09-09 19:34:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:34:53,995 INFO L475 AbstractCegarLoop]: Abstraction has 14444 states and 17173 transitions. [2019-09-09 19:34:53,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 19:34:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 17173 transitions. [2019-09-09 19:34:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-09 19:34:54,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:34:54,001 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:34:54,001 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:34:54,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2087011701, now seen corresponding path program 1 times [2019-09-09 19:34:54,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:34:54,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:54,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:34:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:34:54,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:34:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:34:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 19:34:54,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 19:34:54,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 19:34:54,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2019-09-09 19:34:54,261 INFO L207 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [742], [1635], [1639], [1648], [1652], [1654], [1661], [1662], [1663], [1665], [1666] [2019-09-09 19:34:54,348 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 19:34:54,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 19:34:58,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 19:34:58,644 INFO L272 AbstractInterpreter]: Visited 111 different actions 111 times. Never merged. Never widened. Performed 261 root evaluator evaluations with a maximum evaluation depth of 13. Performed 261 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-09-09 19:34:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:34:58,650 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 19:35:01,201 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 78.21% of their original sizes. [2019-09-09 19:35:01,201 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 19:35:01,293 INFO L420 sIntCurrentIteration]: We unified 243 AI predicates to 243 [2019-09-09 19:35:01,296 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 19:35:01,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 19:35:01,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2019-09-09 19:35:01,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:35:01,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 19:35:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 19:35:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-09 19:35:01,299 INFO L87 Difference]: Start difference. First operand 14444 states and 17173 transitions. Second operand 11 states. [2019-09-09 19:36:02,257 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 19:47:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 19:47:58,083 INFO L93 Difference]: Finished difference Result 14755 states and 17494 transitions. [2019-09-09 19:47:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 19:47:58,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2019-09-09 19:47:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 19:47:58,124 INFO L225 Difference]: With dead ends: 14755 [2019-09-09 19:47:58,124 INFO L226 Difference]: Without dead ends: 14755 [2019-09-09 19:47:58,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-09 19:47:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14755 states. [2019-09-09 19:47:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14755 to 14751. [2019-09-09 19:47:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14751 states. [2019-09-09 19:47:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14751 states to 14751 states and 17486 transitions. [2019-09-09 19:47:58,443 INFO L78 Accepts]: Start accepts. Automaton has 14751 states and 17486 transitions. Word has length 244 [2019-09-09 19:47:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 19:47:58,444 INFO L475 AbstractCegarLoop]: Abstraction has 14751 states and 17486 transitions. [2019-09-09 19:47:58,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 19:47:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14751 states and 17486 transitions. [2019-09-09 19:47:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-09 19:47:58,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 19:47:58,459 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 19:47:58,460 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 19:47:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:47:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1476762848, now seen corresponding path program 1 times [2019-09-09 19:47:58,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 19:47:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:47:58,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 19:47:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 19:47:58,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 19:47:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 19:47:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 340 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-09 19:47:58,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 19:47:58,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 19:47:58,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 482 with the following transitions: [2019-09-09 19:47:58,970 INFO L207 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [742], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [881], [885], [896], [900], [904], [908], [912], [916], [920], [924], [935], [939], [943], [947], [951], [955], [959], [963], [967], [971], [975], [979], [983], [987], [991], [1002], [1006], [1010], [1014], [1018], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1072], [1076], [1080], [1084], [1088], [1092], [1096], [1100], [1104], [1108], [1112], [1116], [1120], [1124], [1128], [1132], [1136], [1140], [1144], [1148], [1152], [1156], [1160], [1164], [1168], [1172], [1176], [1180], [1191], [1202], [1206], [1210], [1214], [1218], [1229], [1233], [1237], [1241], [1245], [1256], [1260], [1264], [1268], [1272], [1276], [1280], [1284], [1288], [1292], [1296], [1300], [1304], [1308], [1312], [1316], [1320], [1324], [1328], [1332], [1336], [1340], [1344], [1348], [1352], [1356], [1367], [1371], [1375], [1378], [1635], [1639], [1648], [1652], [1654], [1661], [1662], [1663], [1665], [1666] [2019-09-09 19:47:58,997 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 19:47:58,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 19:48:11,304 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 19:48:16,677 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 19:48:16,679 INFO L272 AbstractInterpreter]: Visited 246 different actions 487 times. Merged at 4 different actions 5 times. Never widened. Performed 875 root evaluator evaluations with a maximum evaluation depth of 14. Performed 875 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 19:48:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 19:48:16,679 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 19:48:22,239 INFO L227 lantSequenceWeakener]: Weakened 478 states. On average, predicates are now at 77.66% of their original sizes. [2019-09-09 19:48:22,239 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 19:48:22,337 INFO L420 sIntCurrentIteration]: We unified 480 AI predicates to 480 [2019-09-09 19:48:22,337 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 19:48:22,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 19:48:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2019-09-09 19:48:22,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 19:48:22,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 19:48:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 19:48:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-09 19:48:22,339 INFO L87 Difference]: Start difference. First operand 14751 states and 17486 transitions. Second operand 12 states.