java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:20:26,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:20:26,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:20:26,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:20:26,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:20:26,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:20:26,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:20:26,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:20:26,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:20:26,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:20:26,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:20:26,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:20:26,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:20:26,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:20:26,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:20:26,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:20:26,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:20:26,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:20:26,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:20:26,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:20:26,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:20:26,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:20:26,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:20:26,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:20:26,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:20:26,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:20:26,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:20:26,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:20:26,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:20:26,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:20:26,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:20:26,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:20:26,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:20:26,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:20:26,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:20:26,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:20:26,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:20:26,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:20:26,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:20:26,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:20:26,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:20:26,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:20:26,920 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:20:26,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:20:26,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:20:26,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:20:26,922 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:20:26,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:20:26,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:20:26,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:20:26,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:20:26,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:20:26,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:20:26,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:20:26,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:20:26,924 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:20:26,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:20:26,925 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:20:26,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:20:26,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:20:26,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:20:26,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:20:26,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:20:26,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:20:26,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:20:26,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:20:26,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:20:26,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:20:26,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:20:26,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:20:26,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:20:26,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:20:26,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:20:26,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:20:26,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:20:26,972 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:20:26,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label10.c [2019-09-07 20:20:27,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456e9bf84/daa3ab8c51824a9197d8ef74b46c7e55/FLAGc298f6ef6 [2019-09-07 20:20:27,684 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:20:27,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label10.c [2019-09-07 20:20:27,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456e9bf84/daa3ab8c51824a9197d8ef74b46c7e55/FLAGc298f6ef6 [2019-09-07 20:20:27,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456e9bf84/daa3ab8c51824a9197d8ef74b46c7e55 [2019-09-07 20:20:27,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:20:27,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:20:27,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:20:27,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:20:27,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:20:27,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:20:27" (1/1) ... [2019-09-07 20:20:27,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772df1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:27, skipping insertion in model container [2019-09-07 20:20:27,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:20:27" (1/1) ... [2019-09-07 20:20:27,916 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:20:28,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:20:28,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:20:28,857 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:20:29,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:20:29,311 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:20:29,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29 WrapperNode [2019-09-07 20:20:29,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:20:29,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:20:29,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:20:29,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:20:29,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (1/1) ... [2019-09-07 20:20:29,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:20:29,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:20:29,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:20:29,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:20:29,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (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-07 20:20:29,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:20:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:20:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:20:29,566 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:20:29,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:20:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:20:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:20:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:20:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:20:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:20:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:20:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:20:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:20:34,048 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:20:34,048 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:20:34,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:20:34 BoogieIcfgContainer [2019-09-07 20:20:34,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:20:34,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:20:34,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:20:34,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:20:34,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:20:27" (1/3) ... [2019-09-07 20:20:34,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b634c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:20:34, skipping insertion in model container [2019-09-07 20:20:34,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:20:29" (2/3) ... [2019-09-07 20:20:34,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b634c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:20:34, skipping insertion in model container [2019-09-07 20:20:34,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:20:34" (3/3) ... [2019-09-07 20:20:34,071 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label10.c [2019-09-07 20:20:34,085 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:20:34,098 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:20:34,117 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:20:34,178 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:20:34,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:20:34,179 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:20:34,179 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:20:34,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:20:34,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:20:34,180 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:20:34,180 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:20:34,180 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:20:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:20:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 20:20:34,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:34,235 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] [2019-09-07 20:20:34,237 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 92280264, now seen corresponding path program 1 times [2019-09-07 20:20:34,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:34,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:34,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:34,633 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-07 20:20:34,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:34,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:20:34,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:20:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:20:34,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:34,659 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 4 states. [2019-09-07 20:20:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:39,891 INFO L93 Difference]: Finished difference Result 1554 states and 2845 transitions. [2019-09-07 20:20:39,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:20:39,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-07 20:20:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:39,929 INFO L225 Difference]: With dead ends: 1554 [2019-09-07 20:20:39,929 INFO L226 Difference]: Without dead ends: 1036 [2019-09-07 20:20:39,944 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-07 20:20:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-07 20:20:40,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1013. [2019-09-07 20:20:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-09-07 20:20:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1638 transitions. [2019-09-07 20:20:40,145 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1638 transitions. Word has length 40 [2019-09-07 20:20:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:40,146 INFO L475 AbstractCegarLoop]: Abstraction has 1013 states and 1638 transitions. [2019-09-07 20:20:40,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:20:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1638 transitions. [2019-09-07 20:20:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 20:20:40,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:40,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:20:40,162 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1848881283, now seen corresponding path program 1 times [2019-09-07 20:20:40,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:20:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:20:40,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:20:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:20:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:20:40,376 INFO L87 Difference]: Start difference. First operand 1013 states and 1638 transitions. Second operand 5 states. [2019-09-07 20:20:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:44,893 INFO L93 Difference]: Finished difference Result 3003 states and 4930 transitions. [2019-09-07 20:20:44,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:20:44,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-07 20:20:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:44,914 INFO L225 Difference]: With dead ends: 3003 [2019-09-07 20:20:44,915 INFO L226 Difference]: Without dead ends: 1996 [2019-09-07 20:20:44,919 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-07 20:20:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-09-07 20:20:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1958. [2019-09-07 20:20:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2019-09-07 20:20:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2746 transitions. [2019-09-07 20:20:45,007 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2746 transitions. Word has length 112 [2019-09-07 20:20:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:45,009 INFO L475 AbstractCegarLoop]: Abstraction has 1958 states and 2746 transitions. [2019-09-07 20:20:45,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:20:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2746 transitions. [2019-09-07 20:20:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 20:20:45,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:45,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:20:45,014 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1574643571, now seen corresponding path program 1 times [2019-09-07 20:20:45,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:45,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:45,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:45,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:20:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:20:45,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:20:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:20:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:45,245 INFO L87 Difference]: Start difference. First operand 1958 states and 2746 transitions. Second operand 4 states. [2019-09-07 20:20:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:48,927 INFO L93 Difference]: Finished difference Result 7634 states and 11008 transitions. [2019-09-07 20:20:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:20:48,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-07 20:20:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:48,966 INFO L225 Difference]: With dead ends: 7634 [2019-09-07 20:20:48,967 INFO L226 Difference]: Without dead ends: 5682 [2019-09-07 20:20:48,973 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-07 20:20:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5682 states. [2019-09-07 20:20:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5682 to 5679. [2019-09-07 20:20:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-09-07 20:20:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 7490 transitions. [2019-09-07 20:20:49,118 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 7490 transitions. Word has length 120 [2019-09-07 20:20:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:49,119 INFO L475 AbstractCegarLoop]: Abstraction has 5679 states and 7490 transitions. [2019-09-07 20:20:49,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:20:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 7490 transitions. [2019-09-07 20:20:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 20:20:49,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:49,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:20:49,122 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 329094787, now seen corresponding path program 1 times [2019-09-07 20:20:49,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:49,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:49,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:20:49,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:49,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:20:49,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:20:49,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:20:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:20:49,240 INFO L87 Difference]: Start difference. First operand 5679 states and 7490 transitions. Second operand 4 states. [2019-09-07 20:20:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:53,079 INFO L93 Difference]: Finished difference Result 16960 states and 23786 transitions. [2019-09-07 20:20:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:20:53,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-07 20:20:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:53,158 INFO L225 Difference]: With dead ends: 16960 [2019-09-07 20:20:53,158 INFO L226 Difference]: Without dead ends: 11287 [2019-09-07 20:20:53,178 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-07 20:20:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2019-09-07 20:20:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 11283. [2019-09-07 20:20:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11283 states. [2019-09-07 20:20:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11283 states to 11283 states and 15563 transitions. [2019-09-07 20:20:53,495 INFO L78 Accepts]: Start accepts. Automaton has 11283 states and 15563 transitions. Word has length 151 [2019-09-07 20:20:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:53,497 INFO L475 AbstractCegarLoop]: Abstraction has 11283 states and 15563 transitions. [2019-09-07 20:20:53,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:20:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11283 states and 15563 transitions. [2019-09-07 20:20:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 20:20:53,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:53,504 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, 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] [2019-09-07 20:20:53,504 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1065927386, now seen corresponding path program 1 times [2019-09-07 20:20:53,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:53,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:53,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:53,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 20:20:53,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:20:53,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:20:53,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:20:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:20:53,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:20:53,672 INFO L87 Difference]: Start difference. First operand 11283 states and 15563 transitions. Second operand 3 states. [2019-09-07 20:20:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:20:57,292 INFO L93 Difference]: Finished difference Result 32110 states and 45401 transitions. [2019-09-07 20:20:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:20:57,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-07 20:20:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:20:57,415 INFO L225 Difference]: With dead ends: 32110 [2019-09-07 20:20:57,417 INFO L226 Difference]: Without dead ends: 20833 [2019-09-07 20:20:57,452 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-07 20:20:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-09-07 20:20:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 19605. [2019-09-07 20:20:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19605 states. [2019-09-07 20:20:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 27276 transitions. [2019-09-07 20:20:58,731 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 27276 transitions. Word has length 196 [2019-09-07 20:20:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:20:58,732 INFO L475 AbstractCegarLoop]: Abstraction has 19605 states and 27276 transitions. [2019-09-07 20:20:58,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:20:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 27276 transitions. [2019-09-07 20:20:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-09-07 20:20:58,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:20:58,786 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:20:58,786 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:20:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:20:58,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2125732671, now seen corresponding path program 1 times [2019-09-07 20:20:58,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:20:58,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:20:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:58,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:20:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 66 proven. 80 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:20:59,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:20:59,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:20:59,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:20:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:20:59,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:20:59,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:20:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 20:20:59,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:20:59,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:20:59,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:20:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:20:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:20:59,770 INFO L87 Difference]: Start difference. First operand 19605 states and 27276 transitions. Second operand 9 states. [2019-09-07 20:21:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:04,819 INFO L93 Difference]: Finished difference Result 45100 states and 65084 transitions. [2019-09-07 20:21:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 20:21:04,819 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 426 [2019-09-07 20:21:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:04,937 INFO L225 Difference]: With dead ends: 45100 [2019-09-07 20:21:04,938 INFO L226 Difference]: Without dead ends: 25501 [2019-09-07 20:21:05,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:21:05,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25501 states. [2019-09-07 20:21:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25501 to 22693. [2019-09-07 20:21:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22693 states. [2019-09-07 20:21:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22693 states to 22693 states and 30303 transitions. [2019-09-07 20:21:05,754 INFO L78 Accepts]: Start accepts. Automaton has 22693 states and 30303 transitions. Word has length 426 [2019-09-07 20:21:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:05,755 INFO L475 AbstractCegarLoop]: Abstraction has 22693 states and 30303 transitions. [2019-09-07 20:21:05,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:21:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 22693 states and 30303 transitions. [2019-09-07 20:21:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-09-07 20:21:05,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:05,810 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, 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, 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, 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, 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, 1, 1] [2019-09-07 20:21:05,814 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1399642872, now seen corresponding path program 1 times [2019-09-07 20:21:05,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:05,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:05,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:05,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 186 proven. 85 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-07 20:21:06,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:06,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:06,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:21:06,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 433 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-07 20:21:07,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:07,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:21:07,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:21:07,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:21:07,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:21:07,070 INFO L87 Difference]: Start difference. First operand 22693 states and 30303 transitions. Second operand 9 states. [2019-09-07 20:21:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:12,657 INFO L93 Difference]: Finished difference Result 49856 states and 67736 transitions. [2019-09-07 20:21:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:21:12,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 628 [2019-09-07 20:21:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:12,756 INFO L225 Difference]: With dead ends: 49856 [2019-09-07 20:21:12,756 INFO L226 Difference]: Without dead ends: 27169 [2019-09-07 20:21:12,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:21:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27169 states. [2019-09-07 20:21:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27169 to 26475. [2019-09-07 20:21:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26475 states. [2019-09-07 20:21:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26475 states to 26475 states and 33094 transitions. [2019-09-07 20:21:13,275 INFO L78 Accepts]: Start accepts. Automaton has 26475 states and 33094 transitions. Word has length 628 [2019-09-07 20:21:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:13,276 INFO L475 AbstractCegarLoop]: Abstraction has 26475 states and 33094 transitions. [2019-09-07 20:21:13,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:21:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 26475 states and 33094 transitions. [2019-09-07 20:21:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-09-07 20:21:13,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:13,319 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, 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, 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, 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, 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] [2019-09-07 20:21:13,319 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:13,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1758277439, now seen corresponding path program 1 times [2019-09-07 20:21:13,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:13,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 411 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:21:14,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:14,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:21:14,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:14,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:21:14,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:21:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-09-07 20:21:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:21:14,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:21:14,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:21:14,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:21:14,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:21:14,980 INFO L87 Difference]: Start difference. First operand 26475 states and 33094 transitions. Second operand 9 states. [2019-09-07 20:21:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:21:24,008 INFO L93 Difference]: Finished difference Result 71419 states and 90476 transitions. [2019-09-07 20:21:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 20:21:24,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 651 [2019-09-07 20:21:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:21:24,113 INFO L225 Difference]: With dead ends: 71419 [2019-09-07 20:21:24,113 INFO L226 Difference]: Without dead ends: 41408 [2019-09-07 20:21:24,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-09-07 20:21:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41408 states. [2019-09-07 20:21:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41408 to 35228. [2019-09-07 20:21:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35228 states. [2019-09-07 20:21:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35228 states to 35228 states and 41053 transitions. [2019-09-07 20:21:24,771 INFO L78 Accepts]: Start accepts. Automaton has 35228 states and 41053 transitions. Word has length 651 [2019-09-07 20:21:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:21:24,771 INFO L475 AbstractCegarLoop]: Abstraction has 35228 states and 41053 transitions. [2019-09-07 20:21:24,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:21:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 35228 states and 41053 transitions. [2019-09-07 20:21:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-09-07 20:21:24,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:21:24,803 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, 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, 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, 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, 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, 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] [2019-09-07 20:21:24,803 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:21:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:21:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1295125359, now seen corresponding path program 1 times [2019-09-07 20:21:24,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:21:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:21:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:24,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:24,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:21:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 6 proven. 111 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2019-09-07 20:21:25,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:21:25,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:21:25,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:21:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:21:26,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 20:21:26,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:21:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:26,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,067 WARN L188 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-07 20:21:29,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 20:21:29,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:29,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:21:30,515 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2019-09-07 20:21:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:21:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 451 proven. 36 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:21:32,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:21:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-07 20:21:32,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 20:21:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 20:21:32,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-09-07 20:21:32,017 INFO L87 Difference]: Start difference. First operand 35228 states and 41053 transitions. Second operand 20 states. [2019-09-07 20:21:33,336 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-07 20:21:35,349 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 20:21:36,741 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-07 20:21:47,757 WARN L188 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-09-07 20:21:51,181 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-07 20:21:54,861 WARN L188 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2019-09-07 20:21:58,456 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-07 20:21:59,865 WARN L188 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 20:22:07,748 WARN L188 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-09-07 20:22:24,252 WARN L188 SmtUtils]: Spent 13.80 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-07 20:22:27,480 WARN L188 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 20:22:31,329 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-09-07 20:22:34,476 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-07 20:22:42,244 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 20:22:43,787 WARN L188 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2019-09-07 20:22:44,758 WARN L188 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-09-07 20:22:50,446 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 20:22:57,003 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 20:23:02,783 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-07 20:23:06,366 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-09-07 20:23:07,091 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-07 20:23:10,794 WARN L188 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 20:23:13,933 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 20:23:24,617 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-07 20:23:27,615 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-07 20:23:31,947 WARN L188 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 20:23:32,615 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-09-07 20:23:39,038 WARN L188 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-07 20:23:48,052 WARN L188 SmtUtils]: Spent 618.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 20:23:56,514 WARN L188 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-07 20:24:03,920 WARN L188 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-07 20:24:13,281 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 20:24:26,829 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-09-07 20:24:41,221 WARN L188 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 20:24:50,185 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-07 20:24:52,009 WARN L188 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-07 20:24:53,658 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 20:24:55,276 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 20:24:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:24:55,975 INFO L93 Difference]: Finished difference Result 102660 states and 124172 transitions. [2019-09-07 20:24:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-07 20:24:55,976 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 728 [2019-09-07 20:24:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:24:56,207 INFO L225 Difference]: With dead ends: 102660 [2019-09-07 20:24:56,207 INFO L226 Difference]: Without dead ends: 67091 [2019-09-07 20:24:56,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 887 SyntacticMatches, 1 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27367 ImplicationChecksByTransitivity, 70.5s TimeCoverageRelationStatistics Valid=6158, Invalid=55085, Unknown=13, NotChecked=0, Total=61256 [2019-09-07 20:24:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67091 states. [2019-09-07 20:24:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67091 to 60168. [2019-09-07 20:24:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60168 states. [2019-09-07 20:24:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60168 states to 60168 states and 68542 transitions. [2019-09-07 20:24:57,395 INFO L78 Accepts]: Start accepts. Automaton has 60168 states and 68542 transitions. Word has length 728 [2019-09-07 20:24:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:24:57,396 INFO L475 AbstractCegarLoop]: Abstraction has 60168 states and 68542 transitions. [2019-09-07 20:24:57,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 20:24:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60168 states and 68542 transitions. [2019-09-07 20:24:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2019-09-07 20:24:57,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:24:57,433 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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] [2019-09-07 20:24:57,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:24:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:24:57,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1201995278, now seen corresponding path program 1 times [2019-09-07 20:24:57,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:24:57,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:24:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:24:57,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:24:57,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:24:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:24:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 143 proven. 839 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-07 20:24:59,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:24:59,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:24:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:24:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:24:59,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 20:24:59,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:24:59,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:24:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:24:59,874 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 25 [2019-09-07 20:25:00,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:25:00,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:00,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:25:35,662 WARN L188 SmtUtils]: Spent 35.20 s on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-09-07 20:25:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 20:25:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-07 20:25:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 20:25:49,896 WARN L188 SmtUtils]: Spent 14.00 s on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2019-09-07 20:25:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:25:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 668 proven. 36 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-09-07 20:25:52,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:25:52,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-09-07 20:25:52,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 20:25:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 20:25:52,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:25:52,325 INFO L87 Difference]: Start difference. First operand 60168 states and 68542 transitions. Second operand 22 states. [2019-09-07 20:25:54,954 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-07 20:25:55,349 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-07 20:25:56,052 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 20:26:01,899 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-07 20:26:02,736 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-07 20:26:04,210 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-07 20:26:04,553 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-07 20:26:05,672 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-07 20:26:14,550 WARN L188 SmtUtils]: Spent 7.73 s on a formula simplification that was a NOOP. DAG size: 98 [2019-09-07 20:26:15,289 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-07 20:26:15,719 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-07 20:26:19,535 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-07 20:26:31,196 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-07 20:26:39,577 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 20:26:43,484 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-07 20:27:00,771 WARN L188 SmtUtils]: Spent 15.93 s on a formula simplification. DAG size of input: 132 DAG size of output: 120 [2019-09-07 20:27:10,496 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-07 20:27:14,414 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-07 20:27:31,019 WARN L188 SmtUtils]: Spent 11.65 s on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-09-07 20:27:42,409 WARN L188 SmtUtils]: Spent 11.31 s on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-07 20:28:09,434 WARN L188 SmtUtils]: Spent 19.40 s on a formula simplification that was a NOOP. DAG size: 91 [2019-09-07 20:28:16,734 WARN L188 SmtUtils]: Spent 7.22 s on a formula simplification that was a NOOP. DAG size: 86 [2019-09-07 20:28:28,743 WARN L188 SmtUtils]: Spent 5.65 s on a formula simplification that was a NOOP. DAG size: 82 [2019-09-07 20:28:39,150 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-07 20:28:44,062 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 20:28:54,131 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-07 20:29:01,617 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-07 20:29:01,884 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-07 20:29:04,185 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-07 20:29:04,679 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-07 20:29:04,831 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-07 20:29:10,504 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-07 20:29:29,541 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-07 20:29:29,746 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-07 20:29:32,167 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-07 20:29:32,488 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-07 20:29:47,550 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-07 20:30:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:30:17,049 INFO L93 Difference]: Finished difference Result 131025 states and 148813 transitions. [2019-09-07 20:30:17,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-07 20:30:17,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 909 [2019-09-07 20:30:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:30:17,178 INFO L225 Difference]: With dead ends: 131025 [2019-09-07 20:30:17,179 INFO L226 Difference]: Without dead ends: 70846 [2019-09-07 20:30:17,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1095 GetRequests, 958 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 145.5s TimeCoverageRelationStatistics Valid=2410, Invalid=15946, Unknown=4, NotChecked=0, Total=18360 [2019-09-07 20:30:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70846 states. [2019-09-07 20:30:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70846 to 65220. [2019-09-07 20:30:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65220 states. [2019-09-07 20:30:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65220 states to 65220 states and 73628 transitions. [2019-09-07 20:30:18,675 INFO L78 Accepts]: Start accepts. Automaton has 65220 states and 73628 transitions. Word has length 909 [2019-09-07 20:30:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:30:18,676 INFO L475 AbstractCegarLoop]: Abstraction has 65220 states and 73628 transitions. [2019-09-07 20:30:18,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 20:30:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 65220 states and 73628 transitions. [2019-09-07 20:30:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2019-09-07 20:30:18,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:30:18,710 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:30:18,710 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:30:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:30:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1354583368, now seen corresponding path program 1 times [2019-09-07 20:30:18,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:30:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:30:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:18,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 754 proven. 32 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 20:30:19,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:30:19,520 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:30:19,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:19,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 20:30:19,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:30:19,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:19,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:30:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 750 proven. 36 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-09-07 20:30:21,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:30:21,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-07 20:30:21,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:30:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:30:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:30:21,385 INFO L87 Difference]: Start difference. First operand 65220 states and 73628 transitions. Second operand 11 states. [2019-09-07 20:30:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:30:31,632 INFO L93 Difference]: Finished difference Result 142308 states and 160032 transitions. [2019-09-07 20:30:31,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:30:31,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 993 [2019-09-07 20:30:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:30:31,874 INFO L225 Difference]: With dead ends: 142308 [2019-09-07 20:30:31,874 INFO L226 Difference]: Without dead ends: 77079 [2019-09-07 20:30:32,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1029 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:30:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77079 states. [2019-09-07 20:30:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77079 to 66777. [2019-09-07 20:30:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66777 states. [2019-09-07 20:30:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66777 states to 66777 states and 75294 transitions. [2019-09-07 20:30:33,397 INFO L78 Accepts]: Start accepts. Automaton has 66777 states and 75294 transitions. Word has length 993 [2019-09-07 20:30:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:30:33,399 INFO L475 AbstractCegarLoop]: Abstraction has 66777 states and 75294 transitions. [2019-09-07 20:30:33,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:30:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 66777 states and 75294 transitions. [2019-09-07 20:30:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2019-09-07 20:30:33,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:30:33,447 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 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] [2019-09-07 20:30:33,448 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:30:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:30:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash 97221569, now seen corresponding path program 1 times [2019-09-07 20:30:33,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:30:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:30:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:33,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:30:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 758 proven. 32 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 20:30:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:30:34,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:30:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:30:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:30:34,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 20:30:34,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:30:34,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:35,407 WARN L188 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 15 [2019-09-07 20:30:35,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:30:35,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:30:35,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:30:35,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:30:47,651 WARN L188 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 122 DAG size of output: 65 [2019-09-07 20:30:47,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:30:47,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:30:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:30:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 754 proven. 36 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-09-07 20:30:50,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:30:50,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 20:30:50,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:30:50,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:30:50,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2019-09-07 20:30:50,839 INFO L87 Difference]: Start difference. First operand 66777 states and 75294 transitions. Second operand 12 states. [2019-09-07 20:30:52,843 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-07 20:30:53,742 WARN L188 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-09-07 20:31:09,020 WARN L188 SmtUtils]: Spent 13.30 s on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-09-07 20:31:10,200 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-09-07 20:31:17,713 WARN L188 SmtUtils]: Spent 6.93 s on a formula simplification that was a NOOP. DAG size: 89 [2019-09-07 20:31:19,259 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-07 20:31:41,222 WARN L188 SmtUtils]: Spent 15.32 s on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-07 20:31:42,936 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-07 20:31:53,954 WARN L188 SmtUtils]: Spent 7.60 s on a formula simplification that was a NOOP. DAG size: 75 [2019-09-07 20:32:08,826 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-07 20:32:19,201 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 20:32:29,756 WARN L188 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 80 [2019-09-07 20:32:37,107 WARN L188 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-07 20:32:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:40,183 INFO L93 Difference]: Finished difference Result 155139 states and 175009 transitions. [2019-09-07 20:32:40,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 20:32:40,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 997 [2019-09-07 20:32:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:40,369 INFO L225 Difference]: With dead ends: 155139 [2019-09-07 20:32:40,369 INFO L226 Difference]: Without dead ends: 88027 [2019-09-07 20:32:40,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=611, Invalid=2249, Unknown=2, NotChecked=0, Total=2862 [2019-09-07 20:32:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88027 states. [2019-09-07 20:32:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88027 to 75797. [2019-09-07 20:32:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75797 states. [2019-09-07 20:32:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75797 states to 75797 states and 85785 transitions. [2019-09-07 20:32:41,425 INFO L78 Accepts]: Start accepts. Automaton has 75797 states and 85785 transitions. Word has length 997 [2019-09-07 20:32:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:41,426 INFO L475 AbstractCegarLoop]: Abstraction has 75797 states and 85785 transitions. [2019-09-07 20:32:41,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:32:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 75797 states and 85785 transitions. [2019-09-07 20:32:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1141 [2019-09-07 20:32:41,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:41,508 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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-07 20:32:41,508 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1263221832, now seen corresponding path program 1 times [2019-09-07 20:32:41,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:41,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 226 proven. 2 refuted. 0 times theorem prover too weak. 1871 trivial. 0 not checked. [2019-09-07 20:32:43,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:43,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:32:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:43,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:32:43,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2099 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-09-07 20:32:43,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:32:43,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:32:43,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:32:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:32:43,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:32:43,931 INFO L87 Difference]: Start difference. First operand 75797 states and 85785 transitions. Second operand 3 states. [2019-09-07 20:32:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:46,369 INFO L93 Difference]: Finished difference Result 156438 states and 176663 transitions. [2019-09-07 20:32:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:32:46,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1140 [2019-09-07 20:32:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:46,524 INFO L225 Difference]: With dead ends: 156438 [2019-09-07 20:32:46,524 INFO L226 Difference]: Without dead ends: 73397 [2019-09-07 20:32:46,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 1141 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-07 20:32:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73397 states. [2019-09-07 20:32:47,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73397 to 70012. [2019-09-07 20:32:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70012 states. [2019-09-07 20:32:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70012 states to 70012 states and 77386 transitions. [2019-09-07 20:32:47,776 INFO L78 Accepts]: Start accepts. Automaton has 70012 states and 77386 transitions. Word has length 1140 [2019-09-07 20:32:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:47,777 INFO L475 AbstractCegarLoop]: Abstraction has 70012 states and 77386 transitions. [2019-09-07 20:32:47,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:32:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 70012 states and 77386 transitions. [2019-09-07 20:32:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1151 [2019-09-07 20:32:47,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:47,865 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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-07 20:32:47,865 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:47,866 INFO L82 PathProgramCache]: Analyzing trace with hash 720622311, now seen corresponding path program 1 times [2019-09-07 20:32:47,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:47,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:47,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:47,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:47,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 979 proven. 2 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-09-07 20:32:48,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:48,978 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:32:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:49,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:32:49,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 979 proven. 2 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-09-07 20:32:51,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:32:51,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:32:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:32:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:32:51,189 INFO L87 Difference]: Start difference. First operand 70012 states and 77386 transitions. Second operand 7 states. [2019-09-07 20:32:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:32:55,180 INFO L93 Difference]: Finished difference Result 139670 states and 155906 transitions. [2019-09-07 20:32:55,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:32:55,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1150 [2019-09-07 20:32:55,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:32:55,324 INFO L225 Difference]: With dead ends: 139670 [2019-09-07 20:32:55,324 INFO L226 Difference]: Without dead ends: 69971 [2019-09-07 20:32:55,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:32:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69971 states. [2019-09-07 20:32:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69971 to 64055. [2019-09-07 20:32:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64055 states. [2019-09-07 20:32:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64055 states to 64055 states and 70071 transitions. [2019-09-07 20:32:56,131 INFO L78 Accepts]: Start accepts. Automaton has 64055 states and 70071 transitions. Word has length 1150 [2019-09-07 20:32:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:32:56,132 INFO L475 AbstractCegarLoop]: Abstraction has 64055 states and 70071 transitions. [2019-09-07 20:32:56,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:32:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 64055 states and 70071 transitions. [2019-09-07 20:32:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1255 [2019-09-07 20:32:56,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:32:56,199 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 20:32:56,199 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:32:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:32:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -665782301, now seen corresponding path program 1 times [2019-09-07 20:32:56,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:32:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:32:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:56,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:56,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:32:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 845 proven. 258 refuted. 0 times theorem prover too weak. 1252 trivial. 0 not checked. [2019-09-07 20:32:57,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:32:57,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:32:57,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:32:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:32:57,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1611 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:32:57,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:32:57,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:32:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1705 proven. 2 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-09-07 20:32:58,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:32:58,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-07 20:32:58,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:32:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:32:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:32:58,732 INFO L87 Difference]: Start difference. First operand 64055 states and 70071 transitions. Second operand 7 states. [2019-09-07 20:33:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:33:02,408 INFO L93 Difference]: Finished difference Result 100995 states and 110341 transitions. [2019-09-07 20:33:02,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 20:33:02,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1254 [2019-09-07 20:33:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:33:02,485 INFO L225 Difference]: With dead ends: 100995 [2019-09-07 20:33:02,486 INFO L226 Difference]: Without dead ends: 37253 [2019-09-07 20:33:02,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1254 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:33:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37253 states. [2019-09-07 20:33:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37253 to 34778. [2019-09-07 20:33:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34778 states. [2019-09-07 20:33:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34778 states to 34778 states and 36559 transitions. [2019-09-07 20:33:02,946 INFO L78 Accepts]: Start accepts. Automaton has 34778 states and 36559 transitions. Word has length 1254 [2019-09-07 20:33:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:33:02,946 INFO L475 AbstractCegarLoop]: Abstraction has 34778 states and 36559 transitions. [2019-09-07 20:33:02,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:33:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 34778 states and 36559 transitions. [2019-09-07 20:33:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2019-09-07 20:33:02,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:33:02,990 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2019-09-07 20:33:02,991 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:33:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:33:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1003333537, now seen corresponding path program 1 times [2019-09-07 20:33:02,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:33:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:33:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:33:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:33:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:33:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:33:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 228 proven. 6 refuted. 0 times theorem prover too weak. 2330 trivial. 0 not checked. [2019-09-07 20:33:04,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:33:04,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:33:04,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:33:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:33:04,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1641 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 20:33:04,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:33:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2564 backedges. 1550 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-09-07 20:33:05,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:33:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:33:05,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:33:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:33:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:33:05,026 INFO L87 Difference]: Start difference. First operand 34778 states and 36559 transitions. Second operand 3 states. [2019-09-07 20:33:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:33:06,399 INFO L93 Difference]: Finished difference Result 68600 states and 71979 transitions. [2019-09-07 20:33:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:33:06,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1287 [2019-09-07 20:33:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:33:06,451 INFO L225 Difference]: With dead ends: 68600 [2019-09-07 20:33:06,451 INFO L226 Difference]: Without dead ends: 34135 [2019-09-07 20:33:06,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1289 GetRequests, 1288 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-07 20:33:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34135 states. [2019-09-07 20:33:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34135 to 33211. [2019-09-07 20:33:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33211 states. [2019-09-07 20:33:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33211 states to 33211 states and 34721 transitions. [2019-09-07 20:33:06,793 INFO L78 Accepts]: Start accepts. Automaton has 33211 states and 34721 transitions. Word has length 1287 [2019-09-07 20:33:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:33:06,794 INFO L475 AbstractCegarLoop]: Abstraction has 33211 states and 34721 transitions. [2019-09-07 20:33:06,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:33:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33211 states and 34721 transitions. [2019-09-07 20:33:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1313 [2019-09-07 20:33:06,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:33:06,828 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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-07 20:33:06,828 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:33:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:33:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash 326657690, now seen corresponding path program 1 times [2019-09-07 20:33:06,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:33:06,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:33:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:33:06,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:33:06,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:33:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:33:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1785 proven. 100 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-09-07 20:33:08,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:33:08,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:33:08,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:33:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:33:09,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1702 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:33:09,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:33:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:33:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2988 backedges. 1211 proven. 2 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2019-09-07 20:33:10,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:33:10,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:33:10,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:33:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:33:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:33:10,028 INFO L87 Difference]: Start difference. First operand 33211 states and 34721 transitions. Second operand 11 states. [2019-09-07 20:33:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:33:15,290 INFO L93 Difference]: Finished difference Result 64330 states and 67499 transitions. [2019-09-07 20:33:15,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 20:33:15,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1312 [2019-09-07 20:33:15,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:33:15,292 INFO L225 Difference]: With dead ends: 64330 [2019-09-07 20:33:15,292 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:33:15,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1361 GetRequests, 1335 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=563, Unknown=0, NotChecked=0, Total=756 [2019-09-07 20:33:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:33:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:33:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:33:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:33:15,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1312 [2019-09-07 20:33:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:33:15,342 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:33:15,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:33:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:33:15,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:33:15,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:33:17,051 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 170 [2019-09-07 20:33:21,897 WARN L188 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 1474 DAG size of output: 989 [2019-09-07 20:33:24,661 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 1474 DAG size of output: 989 [2019-09-07 20:33:25,223 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 203 [2019-09-07 20:33:25,600 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 203