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/Problem17_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 21:25:47,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 21:25:47,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 21:25:47,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 21:25:47,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 21:25:47,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 21:25:47,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 21:25:47,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 21:25:47,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 21:25:47,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 21:25:47,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 21:25:47,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 21:25:47,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 21:25:47,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 21:25:47,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 21:25:47,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 21:25:47,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 21:25:47,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 21:25:47,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 21:25:47,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 21:25:47,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 21:25:47,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 21:25:47,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 21:25:47,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 21:25:47,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 21:25:47,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 21:25:47,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 21:25:47,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 21:25:47,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 21:25:47,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 21:25:47,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 21:25:47,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 21:25:47,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 21:25:47,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 21:25:47,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 21:25:47,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 21:25:47,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 21:25:47,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 21:25:47,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 21:25:47,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 21:25:47,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 21:25:47,811 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 21:25:47,825 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 21:25:47,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 21:25:47,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 21:25:47,826 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 21:25:47,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 21:25:47,827 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 21:25:47,827 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 21:25:47,828 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 21:25:47,828 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 21:25:47,828 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 21:25:47,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 21:25:47,829 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 21:25:47,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 21:25:47,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 21:25:47,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 21:25:47,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 21:25:47,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 21:25:47,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 21:25:47,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 21:25:47,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 21:25:47,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 21:25:47,831 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 21:25:47,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 21:25:47,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 21:25:47,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 21:25:47,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 21:25:47,832 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 21:25:47,832 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 21:25:47,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 21:25:47,833 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 21:25:47,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 21:25:47,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 21:25:47,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 21:25:47,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 21:25:47,891 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 21:25:47,891 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label38.c [2019-09-09 21:25:47,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2f2f5bc/4c844402b768486abb44898eac9ee7f1/FLAG94c030fb8 [2019-09-09 21:25:48,642 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 21:25:48,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label38.c [2019-09-09 21:25:48,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2f2f5bc/4c844402b768486abb44898eac9ee7f1/FLAG94c030fb8 [2019-09-09 21:25:48,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c2f2f5bc/4c844402b768486abb44898eac9ee7f1 [2019-09-09 21:25:48,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 21:25:48,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 21:25:48,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 21:25:48,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 21:25:48,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 21:25:48,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:25:48" (1/1) ... [2019-09-09 21:25:48,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c883f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:48, skipping insertion in model container [2019-09-09 21:25:48,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:25:48" (1/1) ... [2019-09-09 21:25:48,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 21:25:48,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 21:25:50,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:25:50,055 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 21:25:50,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:25:50,556 INFO L192 MainTranslator]: Completed translation [2019-09-09 21:25:50,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50 WrapperNode [2019-09-09 21:25:50,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 21:25:50,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 21:25:50,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 21:25:50,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 21:25:50,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (1/1) ... [2019-09-09 21:25:50,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 21:25:50,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 21:25:50,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 21:25:50,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 21:25:50,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (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 21:25:51,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 21:25:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 21:25:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 21:25:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-09 21:25:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 21:25:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 21:25:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-09 21:25:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 21:25:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 21:25:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 21:25:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 21:25:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 21:25:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 21:25:55,531 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 21:25:55,532 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 21:25:55,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:25:55 BoogieIcfgContainer [2019-09-09 21:25:55,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 21:25:55,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 21:25:55,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 21:25:55,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 21:25:55,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 09:25:48" (1/3) ... [2019-09-09 21:25:55,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bd0a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:25:55, skipping insertion in model container [2019-09-09 21:25:55,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:25:50" (2/3) ... [2019-09-09 21:25:55,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bd0a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:25:55, skipping insertion in model container [2019-09-09 21:25:55,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:25:55" (3/3) ... [2019-09-09 21:25:55,544 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label38.c [2019-09-09 21:25:55,554 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 21:25:55,562 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 21:25:55,579 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 21:25:55,607 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 21:25:55,607 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 21:25:55,607 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 21:25:55,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 21:25:55,608 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 21:25:55,608 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 21:25:55,608 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 21:25:55,608 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 21:25:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-09 21:25:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 21:25:55,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:25:55,664 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 21:25:55,666 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:25:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:25:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 653622185, now seen corresponding path program 1 times [2019-09-09 21:25:55,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:25:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:25:55,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:25:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:25:55,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:25:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:25:56,115 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 21:25:56,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:25:56,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:25:56,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:25:56,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:25:56,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:25:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:25:56,142 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-09 21:26:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:03,061 INFO L93 Difference]: Finished difference Result 1536 states and 2305 transitions. [2019-09-09 21:26:03,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:26:03,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-09 21:26:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:03,094 INFO L225 Difference]: With dead ends: 1536 [2019-09-09 21:26:03,094 INFO L226 Difference]: Without dead ends: 1451 [2019-09-09 21:26:03,096 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 21:26:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-09-09 21:26:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1437. [2019-09-09 21:26:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2019-09-09 21:26:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2166 transitions. [2019-09-09 21:26:03,281 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2166 transitions. Word has length 58 [2019-09-09 21:26:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:03,282 INFO L475 AbstractCegarLoop]: Abstraction has 1437 states and 2166 transitions. [2019-09-09 21:26:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:26:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2166 transitions. [2019-09-09 21:26:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 21:26:03,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:03,299 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] [2019-09-09 21:26:03,299 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:03,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1271486156, now seen corresponding path program 1 times [2019-09-09 21:26:03,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:03,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:03,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:03,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:03,543 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 21:26:03,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:26:03,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 21:26:03,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:03,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 21:26:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 21:26:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 21:26:03,547 INFO L87 Difference]: Start difference. First operand 1437 states and 2166 transitions. Second operand 5 states. [2019-09-09 21:26:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:08,626 INFO L93 Difference]: Finished difference Result 2824 states and 4003 transitions. [2019-09-09 21:26:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:26:08,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-09 21:26:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:08,649 INFO L225 Difference]: With dead ends: 2824 [2019-09-09 21:26:08,649 INFO L226 Difference]: Without dead ends: 2824 [2019-09-09 21:26:08,650 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 21:26:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2019-09-09 21:26:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2794. [2019-09-09 21:26:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-09-09 21:26:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3921 transitions. [2019-09-09 21:26:08,758 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3921 transitions. Word has length 129 [2019-09-09 21:26:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:08,759 INFO L475 AbstractCegarLoop]: Abstraction has 2794 states and 3921 transitions. [2019-09-09 21:26:08,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 21:26:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3921 transitions. [2019-09-09 21:26:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-09 21:26:08,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:08,761 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] [2019-09-09 21:26:08,762 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1845082816, now seen corresponding path program 1 times [2019-09-09 21:26:08,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:08,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:08,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:08,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:08,990 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 21:26:08,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:26:08,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 21:26:08,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:08,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 21:26:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 21:26:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:26:08,994 INFO L87 Difference]: Start difference. First operand 2794 states and 3921 transitions. Second operand 3 states. [2019-09-09 21:26:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:12,162 INFO L93 Difference]: Finished difference Result 3683 states and 5057 transitions. [2019-09-09 21:26:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 21:26:12,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-09 21:26:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:12,190 INFO L225 Difference]: With dead ends: 3683 [2019-09-09 21:26:12,191 INFO L226 Difference]: Without dead ends: 3683 [2019-09-09 21:26:12,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:26:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3683 states. [2019-09-09 21:26:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3683 to 3681. [2019-09-09 21:26:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3681 states. [2019-09-09 21:26:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 5053 transitions. [2019-09-09 21:26:12,294 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 5053 transitions. Word has length 132 [2019-09-09 21:26:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:12,295 INFO L475 AbstractCegarLoop]: Abstraction has 3681 states and 5053 transitions. [2019-09-09 21:26:12,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 21:26:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 5053 transitions. [2019-09-09 21:26:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-09 21:26:12,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:12,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:26:12,303 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1109177583, now seen corresponding path program 1 times [2019-09-09 21:26:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:12,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:12,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:12,569 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 21:26:12,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:26:12,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 21:26:12,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:12,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 21:26:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 21:26:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 21:26:12,572 INFO L87 Difference]: Start difference. First operand 3681 states and 5053 transitions. Second operand 6 states. [2019-09-09 21:26:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:16,673 INFO L93 Difference]: Finished difference Result 5527 states and 6762 transitions. [2019-09-09 21:26:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:26:16,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-09-09 21:26:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:16,710 INFO L225 Difference]: With dead ends: 5527 [2019-09-09 21:26:16,710 INFO L226 Difference]: Without dead ends: 5527 [2019-09-09 21:26:16,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 21:26:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2019-09-09 21:26:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 5054. [2019-09-09 21:26:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5054 states. [2019-09-09 21:26:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5054 states to 5054 states and 6165 transitions. [2019-09-09 21:26:16,831 INFO L78 Accepts]: Start accepts. Automaton has 5054 states and 6165 transitions. Word has length 212 [2019-09-09 21:26:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:16,833 INFO L475 AbstractCegarLoop]: Abstraction has 5054 states and 6165 transitions. [2019-09-09 21:26:16,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 21:26:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 5054 states and 6165 transitions. [2019-09-09 21:26:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-09 21:26:16,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:16,838 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, 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 21:26:16,838 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1224459617, now seen corresponding path program 1 times [2019-09-09 21:26:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:16,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:16,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-09 21:26:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:26:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 21:26:17,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:17,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 21:26:17,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 21:26:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:26:17,032 INFO L87 Difference]: Start difference. First operand 5054 states and 6165 transitions. Second operand 3 states. [2019-09-09 21:26:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:20,227 INFO L93 Difference]: Finished difference Result 9017 states and 10600 transitions. [2019-09-09 21:26:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 21:26:20,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-09-09 21:26:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:20,271 INFO L225 Difference]: With dead ends: 9017 [2019-09-09 21:26:20,271 INFO L226 Difference]: Without dead ends: 9017 [2019-09-09 21:26:20,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:26:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2019-09-09 21:26:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 8584. [2019-09-09 21:26:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8584 states. [2019-09-09 21:26:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8584 states to 8584 states and 10144 transitions. [2019-09-09 21:26:20,441 INFO L78 Accepts]: Start accepts. Automaton has 8584 states and 10144 transitions. Word has length 220 [2019-09-09 21:26:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:20,441 INFO L475 AbstractCegarLoop]: Abstraction has 8584 states and 10144 transitions. [2019-09-09 21:26:20,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 21:26:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8584 states and 10144 transitions. [2019-09-09 21:26:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-09 21:26:20,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:20,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:26:20,448 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1190189028, now seen corresponding path program 1 times [2019-09-09 21:26:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:20,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:20,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:20,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-09 21:26:20,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:26:20,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:26:20,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:20,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:26:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:26:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:26:20,653 INFO L87 Difference]: Start difference. First operand 8584 states and 10144 transitions. Second operand 4 states. [2019-09-09 21:26:26,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:26:26,279 INFO L93 Difference]: Finished difference Result 17838 states and 20764 transitions. [2019-09-09 21:26:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:26:26,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-09 21:26:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:26:26,336 INFO L225 Difference]: With dead ends: 17838 [2019-09-09 21:26:26,337 INFO L226 Difference]: Without dead ends: 17838 [2019-09-09 21:26:26,337 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 21:26:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2019-09-09 21:26:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 16103. [2019-09-09 21:26:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16103 states. [2019-09-09 21:26:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16103 states to 16103 states and 18957 transitions. [2019-09-09 21:26:26,629 INFO L78 Accepts]: Start accepts. Automaton has 16103 states and 18957 transitions. Word has length 238 [2019-09-09 21:26:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:26:26,631 INFO L475 AbstractCegarLoop]: Abstraction has 16103 states and 18957 transitions. [2019-09-09 21:26:26,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:26:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 16103 states and 18957 transitions. [2019-09-09 21:26:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-09 21:26:26,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:26:26,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:26:26,638 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:26:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash -531052150, now seen corresponding path program 1 times [2019-09-09 21:26:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:26:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:26:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:26:26,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:26:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:26:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 98 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:26:26,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 21:26:26,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 21:26:26,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-09-09 21:26:26,916 INFO L207 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1082], [1084], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2292], [2296], [2298], [2305], [2306], [2307], [2309], [2310] [2019-09-09 21:26:27,013 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 21:26:27,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 21:26:30,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 21:26:38,861 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 21:26:38,864 INFO L272 AbstractInterpreter]: Visited 117 different actions 229 times. Merged at 4 different actions 5 times. Never widened. Performed 459 root evaluator evaluations with a maximum evaluation depth of 15. Performed 459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2019-09-09 21:26:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:26:38,868 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 21:26:43,553 INFO L227 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 75.64% of their original sizes. [2019-09-09 21:26:43,553 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 21:26:43,678 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-09-09 21:26:43,679 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 21:26:43,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 21:26:43,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2019-09-09 21:26:43,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:26:43,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 21:26:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 21:26:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-09 21:26:43,681 INFO L87 Difference]: Start difference. First operand 16103 states and 18957 transitions. Second operand 12 states.