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/Problem17_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 21:42:41,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 21:42:41,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 21:42:41,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 21:42:41,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 21:42:41,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 21:42:41,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 21:42:41,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 21:42:41,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 21:42:41,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 21:42:41,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 21:42:41,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 21:42:41,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 21:42:41,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 21:42:41,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 21:42:41,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 21:42:41,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 21:42:41,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 21:42:41,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 21:42:41,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 21:42:41,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 21:42:41,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 21:42:41,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 21:42:41,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 21:42:41,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 21:42:41,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 21:42:41,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 21:42:41,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 21:42:41,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 21:42:41,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 21:42:41,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 21:42:41,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 21:42:41,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 21:42:41,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 21:42:41,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 21:42:41,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 21:42:41,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 21:42:41,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 21:42:41,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 21:42:41,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 21:42:41,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 21:42:41,800 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 21:42:41,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 21:42:41,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 21:42:41,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 21:42:41,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 21:42:41,816 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 21:42:41,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 21:42:41,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 21:42:41,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 21:42:41,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 21:42:41,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 21:42:41,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 21:42:41,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 21:42:41,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 21:42:41,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 21:42:41,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 21:42:41,818 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 21:42:41,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 21:42:41,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 21:42:41,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 21:42:41,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 21:42:41,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 21:42:41,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 21:42:41,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 21:42:41,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 21:42:41,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 21:42:41,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 21:42:41,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 21:42:41,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 21:42:41,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 21:42:41,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 21:42:41,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 21:42:41,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 21:42:41,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 21:42:41,865 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 21:42:41,866 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label24.c [2019-09-07 21:42:41,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62f40df/98799b74b5fa4a43904683aee0b4769e/FLAG3db2d2860 [2019-09-07 21:42:42,680 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 21:42:42,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label24.c [2019-09-07 21:42:42,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62f40df/98799b74b5fa4a43904683aee0b4769e/FLAG3db2d2860 [2019-09-07 21:42:42,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62f40df/98799b74b5fa4a43904683aee0b4769e [2019-09-07 21:42:42,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 21:42:42,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 21:42:42,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 21:42:42,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 21:42:42,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 21:42:42,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:42:42" (1/1) ... [2019-09-07 21:42:42,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4ace30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:42, skipping insertion in model container [2019-09-07 21:42:42,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:42:42" (1/1) ... [2019-09-07 21:42:42,804 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 21:42:42,911 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 21:42:44,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:42:44,078 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 21:42:44,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 21:42:44,517 INFO L192 MainTranslator]: Completed translation [2019-09-07 21:42:44,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44 WrapperNode [2019-09-07 21:42:44,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 21:42:44,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 21:42:44,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 21:42:44,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 21:42:44,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (1/1) ... [2019-09-07 21:42:44,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 21:42:44,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 21:42:44,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 21:42:44,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 21:42:44,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (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 21:42:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 21:42:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 21:42:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 21:42:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 21:42:44,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 21:42:44,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 21:42:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 21:42:44,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 21:42:48,980 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 21:42:48,981 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 21:42:48,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:42:48 BoogieIcfgContainer [2019-09-07 21:42:48,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 21:42:48,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 21:42:48,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 21:42:48,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 21:42:48,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:42:42" (1/3) ... [2019-09-07 21:42:48,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269179ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:42:48, skipping insertion in model container [2019-09-07 21:42:48,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:42:44" (2/3) ... [2019-09-07 21:42:48,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269179ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:42:48, skipping insertion in model container [2019-09-07 21:42:48,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:42:48" (3/3) ... [2019-09-07 21:42:49,004 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label24.c [2019-09-07 21:42:49,014 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 21:42:49,023 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 21:42:49,041 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 21:42:49,090 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 21:42:49,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 21:42:49,091 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 21:42:49,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 21:42:49,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 21:42:49,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 21:42:49,092 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 21:42:49,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 21:42:49,092 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 21:42:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 21:42:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 21:42:49,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:42:49,138 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:42:49,140 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:42:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:42:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash -38263863, now seen corresponding path program 1 times [2019-09-07 21:42:49,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:42:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:42:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:42:49,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:42:49,493 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 21:42:49,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:42:49,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:42:49,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:42:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:42:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:42:49,518 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 21:42:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:42:55,972 INFO L93 Difference]: Finished difference Result 2129 states and 3955 transitions. [2019-09-07 21:42:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:42:55,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-07 21:42:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:42:56,006 INFO L225 Difference]: With dead ends: 2129 [2019-09-07 21:42:56,006 INFO L226 Difference]: Without dead ends: 1447 [2019-09-07 21:42:56,019 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 21:42:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2019-09-07 21:42:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1440. [2019-09-07 21:42:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-09-07 21:42:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2109 transitions. [2019-09-07 21:42:56,143 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2109 transitions. Word has length 66 [2019-09-07 21:42:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:42:56,144 INFO L475 AbstractCegarLoop]: Abstraction has 1440 states and 2109 transitions. [2019-09-07 21:42:56,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:42:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2109 transitions. [2019-09-07 21:42:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 21:42:56,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:42:56,150 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:42:56,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:42:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:42:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1967434272, now seen corresponding path program 1 times [2019-09-07 21:42:56,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:42:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:42:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:56,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:42:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:42:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:42:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:42:56,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:42:56,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:42:56,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:42:56,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:42:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:42:56,424 INFO L87 Difference]: Start difference. First operand 1440 states and 2109 transitions. Second operand 4 states. [2019-09-07 21:43:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:01,678 INFO L93 Difference]: Finished difference Result 5498 states and 8211 transitions. [2019-09-07 21:43:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:43:01,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-07 21:43:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:01,705 INFO L225 Difference]: With dead ends: 5498 [2019-09-07 21:43:01,705 INFO L226 Difference]: Without dead ends: 4064 [2019-09-07 21:43:01,710 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 21:43:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2019-09-07 21:43:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 4060. [2019-09-07 21:43:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-09-07 21:43:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5456 transitions. [2019-09-07 21:43:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5456 transitions. Word has length 140 [2019-09-07 21:43:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:01,818 INFO L475 AbstractCegarLoop]: Abstraction has 4060 states and 5456 transitions. [2019-09-07 21:43:01,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:43:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5456 transitions. [2019-09-07 21:43:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 21:43:01,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:01,824 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:43:01,824 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash -905141195, now seen corresponding path program 1 times [2019-09-07 21:43:01,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:43:02,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:43:02,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 21:43:02,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 21:43:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 21:43:02,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 21:43:02,087 INFO L87 Difference]: Start difference. First operand 4060 states and 5456 transitions. Second operand 6 states. [2019-09-07 21:43:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:06,660 INFO L93 Difference]: Finished difference Result 12215 states and 17159 transitions. [2019-09-07 21:43:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 21:43:06,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-07 21:43:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:06,707 INFO L225 Difference]: With dead ends: 12215 [2019-09-07 21:43:06,707 INFO L226 Difference]: Without dead ends: 8161 [2019-09-07 21:43:06,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:43:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2019-09-07 21:43:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 8115. [2019-09-07 21:43:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8115 states. [2019-09-07 21:43:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8115 states to 8115 states and 10603 transitions. [2019-09-07 21:43:06,928 INFO L78 Accepts]: Start accepts. Automaton has 8115 states and 10603 transitions. Word has length 181 [2019-09-07 21:43:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:06,929 INFO L475 AbstractCegarLoop]: Abstraction has 8115 states and 10603 transitions. [2019-09-07 21:43:06,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 21:43:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8115 states and 10603 transitions. [2019-09-07 21:43:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 21:43:06,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:06,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 21:43:06,936 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash 677012652, now seen corresponding path program 1 times [2019-09-07 21:43:06,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:06,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 21:43:07,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:07,209 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) [2019-09-07 21:43:07,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:43:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:07,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:43:07,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:43:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:43:07,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:43:07,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:43:07,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:43:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:43:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:43:07,475 INFO L87 Difference]: Start difference. First operand 8115 states and 10603 transitions. Second operand 9 states. [2019-09-07 21:43:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:13,169 INFO L93 Difference]: Finished difference Result 20210 states and 26294 transitions. [2019-09-07 21:43:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 21:43:13,169 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 232 [2019-09-07 21:43:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:13,205 INFO L225 Difference]: With dead ends: 20210 [2019-09-07 21:43:13,205 INFO L226 Difference]: Without dead ends: 9426 [2019-09-07 21:43:13,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 21:43:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2019-09-07 21:43:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 8968. [2019-09-07 21:43:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8968 states. [2019-09-07 21:43:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8968 states to 8968 states and 10240 transitions. [2019-09-07 21:43:13,458 INFO L78 Accepts]: Start accepts. Automaton has 8968 states and 10240 transitions. Word has length 232 [2019-09-07 21:43:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:13,458 INFO L475 AbstractCegarLoop]: Abstraction has 8968 states and 10240 transitions. [2019-09-07 21:43:13,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:43:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8968 states and 10240 transitions. [2019-09-07 21:43:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 21:43:13,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:13,463 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 21:43:13,463 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1353819476, now seen corresponding path program 1 times [2019-09-07 21:43:13,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:13,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 21:43:13,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:43:13,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:43:13,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:43:13,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:43:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:43:13,694 INFO L87 Difference]: Start difference. First operand 8968 states and 10240 transitions. Second operand 3 states. [2019-09-07 21:43:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:16,377 INFO L93 Difference]: Finished difference Result 21009 states and 24358 transitions. [2019-09-07 21:43:16,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:43:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-07 21:43:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:16,422 INFO L225 Difference]: With dead ends: 21009 [2019-09-07 21:43:16,422 INFO L226 Difference]: Without dead ends: 11607 [2019-09-07 21:43:16,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:43:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11607 states. [2019-09-07 21:43:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11607 to 11607. [2019-09-07 21:43:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-09-07 21:43:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 13101 transitions. [2019-09-07 21:43:16,660 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 13101 transitions. Word has length 239 [2019-09-07 21:43:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:16,661 INFO L475 AbstractCegarLoop]: Abstraction has 11607 states and 13101 transitions. [2019-09-07 21:43:16,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:43:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 13101 transitions. [2019-09-07 21:43:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 21:43:16,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:16,668 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 21:43:16,668 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:16,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1901728581, now seen corresponding path program 1 times [2019-09-07 21:43:16,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:43:16,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:43:16,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:43:16,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:43:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:43:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:43:16,894 INFO L87 Difference]: Start difference. First operand 11607 states and 13101 transitions. Second operand 4 states. [2019-09-07 21:43:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:18,715 INFO L93 Difference]: Finished difference Result 23197 states and 26223 transitions. [2019-09-07 21:43:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:43:18,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-09-07 21:43:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:18,746 INFO L225 Difference]: With dead ends: 23197 [2019-09-07 21:43:18,747 INFO L226 Difference]: Without dead ends: 11595 [2019-09-07 21:43:18,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:43:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11595 states. [2019-09-07 21:43:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11595 to 11595. [2019-09-07 21:43:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11595 states. [2019-09-07 21:43:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11595 states to 11595 states and 13078 transitions. [2019-09-07 21:43:19,146 INFO L78 Accepts]: Start accepts. Automaton has 11595 states and 13078 transitions. Word has length 288 [2019-09-07 21:43:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:19,147 INFO L475 AbstractCegarLoop]: Abstraction has 11595 states and 13078 transitions. [2019-09-07 21:43:19,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:43:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11595 states and 13078 transitions. [2019-09-07 21:43:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-07 21:43:19,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:19,154 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:19,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 812321832, now seen corresponding path program 1 times [2019-09-07 21:43:19,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:19,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:19,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:43:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:43:19,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 21:43:19,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:43:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:43:19,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:43:19,481 INFO L87 Difference]: Start difference. First operand 11595 states and 13078 transitions. Second operand 4 states. [2019-09-07 21:43:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:24,365 INFO L93 Difference]: Finished difference Result 34629 states and 39698 transitions. [2019-09-07 21:43:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:43:24,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-09-07 21:43:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:24,432 INFO L225 Difference]: With dead ends: 34629 [2019-09-07 21:43:24,432 INFO L226 Difference]: Without dead ends: 23040 [2019-09-07 21:43:24,453 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 21:43:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23040 states. [2019-09-07 21:43:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23040 to 20845. [2019-09-07 21:43:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20845 states. [2019-09-07 21:43:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20845 states to 20845 states and 23693 transitions. [2019-09-07 21:43:24,791 INFO L78 Accepts]: Start accepts. Automaton has 20845 states and 23693 transitions. Word has length 294 [2019-09-07 21:43:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:24,791 INFO L475 AbstractCegarLoop]: Abstraction has 20845 states and 23693 transitions. [2019-09-07 21:43:24,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:43:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20845 states and 23693 transitions. [2019-09-07 21:43:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-07 21:43:24,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:24,800 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:24,800 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:24,801 INFO L82 PathProgramCache]: Analyzing trace with hash 496821381, now seen corresponding path program 1 times [2019-09-07 21:43:24,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:24,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:24,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 133 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 21:43:25,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:25,238 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) [2019-09-07 21:43:25,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:43:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:25,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 21:43:25,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:43:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 21:43:25,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:43:25,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 21:43:25,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:43:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:43:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:43:25,505 INFO L87 Difference]: Start difference. First operand 20845 states and 23693 transitions. Second operand 8 states. [2019-09-07 21:43:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:30,610 INFO L93 Difference]: Finished difference Result 41807 states and 48100 transitions. [2019-09-07 21:43:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 21:43:30,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 318 [2019-09-07 21:43:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:30,662 INFO L225 Difference]: With dead ends: 41807 [2019-09-07 21:43:30,663 INFO L226 Difference]: Without dead ends: 20968 [2019-09-07 21:43:30,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:43:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20968 states. [2019-09-07 21:43:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20968 to 20417. [2019-09-07 21:43:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20417 states. [2019-09-07 21:43:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20417 states to 20417 states and 23211 transitions. [2019-09-07 21:43:30,999 INFO L78 Accepts]: Start accepts. Automaton has 20417 states and 23211 transitions. Word has length 318 [2019-09-07 21:43:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:31,000 INFO L475 AbstractCegarLoop]: Abstraction has 20417 states and 23211 transitions. [2019-09-07 21:43:31,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:43:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 20417 states and 23211 transitions. [2019-09-07 21:43:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-07 21:43:31,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:31,029 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:31,029 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1347377297, now seen corresponding path program 1 times [2019-09-07 21:43:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:31,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:43:31,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:31,672 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:43:31,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:31,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:43:31,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:43:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 21:43:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:43:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 21:43:32,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:43:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:43:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:43:32,059 INFO L87 Difference]: Start difference. First operand 20417 states and 23211 transitions. Second operand 11 states. [2019-09-07 21:43:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:52,460 INFO L93 Difference]: Finished difference Result 69234 states and 80977 transitions. [2019-09-07 21:43:52,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 21:43:52,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 413 [2019-09-07 21:43:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:52,575 INFO L225 Difference]: With dead ends: 69234 [2019-09-07 21:43:52,575 INFO L226 Difference]: Without dead ends: 45740 [2019-09-07 21:43:52,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 21:43:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45740 states. [2019-09-07 21:43:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45740 to 39989. [2019-09-07 21:43:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39989 states. [2019-09-07 21:43:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39989 states to 39989 states and 46884 transitions. [2019-09-07 21:43:53,496 INFO L78 Accepts]: Start accepts. Automaton has 39989 states and 46884 transitions. Word has length 413 [2019-09-07 21:43:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:53,497 INFO L475 AbstractCegarLoop]: Abstraction has 39989 states and 46884 transitions. [2019-09-07 21:43:53,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:43:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 39989 states and 46884 transitions. [2019-09-07 21:43:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 21:43:53,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:53,535 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-09-07 21:43:53,536 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash 627554561, now seen corresponding path program 1 times [2019-09-07 21:43:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 21:43:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 21:43:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 21:43:53,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 21:43:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 21:43:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:43:53,882 INFO L87 Difference]: Start difference. First operand 39989 states and 46884 transitions. Second operand 3 states. [2019-09-07 21:43:56,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:43:56,983 INFO L93 Difference]: Finished difference Result 86085 states and 100852 transitions. [2019-09-07 21:43:56,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 21:43:56,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 446 [2019-09-07 21:43:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:43:57,084 INFO L225 Difference]: With dead ends: 86085 [2019-09-07 21:43:57,085 INFO L226 Difference]: Without dead ends: 45199 [2019-09-07 21:43:57,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 21:43:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45199 states. [2019-09-07 21:43:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45199 to 44752. [2019-09-07 21:43:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44752 states. [2019-09-07 21:43:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44752 states to 44752 states and 51813 transitions. [2019-09-07 21:43:57,990 INFO L78 Accepts]: Start accepts. Automaton has 44752 states and 51813 transitions. Word has length 446 [2019-09-07 21:43:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:43:57,991 INFO L475 AbstractCegarLoop]: Abstraction has 44752 states and 51813 transitions. [2019-09-07 21:43:57,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 21:43:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 44752 states and 51813 transitions. [2019-09-07 21:43:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-07 21:43:58,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:43:58,056 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:43:58,056 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:43:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:43:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 907052242, now seen corresponding path program 1 times [2019-09-07 21:43:58,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:43:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:43:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:58,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:43:58,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:43:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 185 proven. 222 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 21:43:58,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:43:58,672 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) [2019-09-07 21:43:58,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:43:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:43:58,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 21:43:58,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:44:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 350 proven. 58 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 21:44:00,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:44:00,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-07 21:44:00,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:44:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:44:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 21:44:00,371 INFO L87 Difference]: Start difference. First operand 44752 states and 51813 transitions. Second operand 11 states. [2019-09-07 21:44:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:44:20,631 INFO L93 Difference]: Finished difference Result 145142 states and 170213 transitions. [2019-09-07 21:44:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 21:44:20,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 641 [2019-09-07 21:44:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:44:20,870 INFO L225 Difference]: With dead ends: 145142 [2019-09-07 21:44:20,870 INFO L226 Difference]: Without dead ends: 96463 [2019-09-07 21:44:20,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=933, Invalid=5229, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 21:44:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96463 states. [2019-09-07 21:44:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96463 to 87247. [2019-09-07 21:44:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87247 states. [2019-09-07 21:44:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87247 states to 87247 states and 102014 transitions. [2019-09-07 21:44:22,274 INFO L78 Accepts]: Start accepts. Automaton has 87247 states and 102014 transitions. Word has length 641 [2019-09-07 21:44:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:44:22,275 INFO L475 AbstractCegarLoop]: Abstraction has 87247 states and 102014 transitions. [2019-09-07 21:44:22,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 21:44:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 87247 states and 102014 transitions. [2019-09-07 21:44:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2019-09-07 21:44:22,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:44:22,430 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:44:22,430 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:44:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:44:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -232458800, now seen corresponding path program 1 times [2019-09-07 21:44:22,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:44:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:44:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:44:22,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:44:22,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:44:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:44:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 250 proven. 2 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-07 21:44:23,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:44:23,221 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 21:44:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:44:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:44:23,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:44:23,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:44:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 891 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-09-07 21:44:23,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:44:23,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 21:44:23,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:44:23,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:44:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:44:23,744 INFO L87 Difference]: Start difference. First operand 87247 states and 102014 transitions. Second operand 4 states. [2019-09-07 21:44:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:44:29,172 INFO L93 Difference]: Finished difference Result 186635 states and 219222 transitions. [2019-09-07 21:44:29,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:44:29,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 855 [2019-09-07 21:44:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:44:29,343 INFO L225 Difference]: With dead ends: 186635 [2019-09-07 21:44:29,343 INFO L226 Difference]: Without dead ends: 99827 [2019-09-07 21:44:29,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 855 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 21:44:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99827 states. [2019-09-07 21:44:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99827 to 87234. [2019-09-07 21:44:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87234 states. [2019-09-07 21:44:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87234 states to 87234 states and 98930 transitions. [2019-09-07 21:44:30,428 INFO L78 Accepts]: Start accepts. Automaton has 87234 states and 98930 transitions. Word has length 855 [2019-09-07 21:44:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:44:30,429 INFO L475 AbstractCegarLoop]: Abstraction has 87234 states and 98930 transitions. [2019-09-07 21:44:30,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:44:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 87234 states and 98930 transitions. [2019-09-07 21:44:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2019-09-07 21:44:30,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:44:30,529 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:44:30,529 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:44:30,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:44:30,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2139107502, now seen corresponding path program 1 times [2019-09-07 21:44:30,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:44:30,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:44:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:44:30,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:44:30,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:44:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:44:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 629 proven. 313 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-09-07 21:44:32,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:44:32,197 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 21:44:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:44:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:44:32,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 21:44:32,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:44:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:44:32,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:44:32,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 21:44:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 788 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-09-07 21:44:34,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:44:34,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 21:44:34,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:44:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:44:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:44:34,861 INFO L87 Difference]: Start difference. First operand 87234 states and 98930 transitions. Second operand 13 states. [2019-09-07 21:46:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:46:44,277 INFO L93 Difference]: Finished difference Result 195391 states and 223412 transitions. [2019-09-07 21:46:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 21:46:44,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1024 [2019-09-07 21:46:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:46:44,474 INFO L225 Difference]: With dead ends: 195391 [2019-09-07 21:46:44,474 INFO L226 Difference]: Without dead ends: 108596 [2019-09-07 21:46:44,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1119 GetRequests, 1060 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=672, Invalid=2988, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 21:46:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108596 states. [2019-09-07 21:46:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108596 to 101571. [2019-09-07 21:46:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101571 states. [2019-09-07 21:46:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101571 states to 101571 states and 115570 transitions. [2019-09-07 21:46:45,620 INFO L78 Accepts]: Start accepts. Automaton has 101571 states and 115570 transitions. Word has length 1024 [2019-09-07 21:46:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:46:45,620 INFO L475 AbstractCegarLoop]: Abstraction has 101571 states and 115570 transitions. [2019-09-07 21:46:45,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:46:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 101571 states and 115570 transitions. [2019-09-07 21:46:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2019-09-07 21:46:45,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:46:45,765 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, 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:46:45,766 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:46:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:46:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 612787233, now seen corresponding path program 1 times [2019-09-07 21:46:45,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:46:45,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:46:45,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:46:45,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 387 proven. 4 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-09-07 21:46:47,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:46:47,423 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) [2019-09-07 21:46:47,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:46:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:47,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1437 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 21:46:47,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:46:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1191 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-09-07 21:46:49,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 21:46:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 21:46:49,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 21:46:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 21:46:49,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 21:46:49,534 INFO L87 Difference]: Start difference. First operand 101571 states and 115570 transitions. Second operand 4 states. [2019-09-07 21:46:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:46:53,989 INFO L93 Difference]: Finished difference Result 217438 states and 247734 transitions. [2019-09-07 21:46:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 21:46:53,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1064 [2019-09-07 21:46:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:46:54,207 INFO L225 Difference]: With dead ends: 217438 [2019-09-07 21:46:54,207 INFO L226 Difference]: Without dead ends: 116306 [2019-09-07 21:46:54,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1064 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 21:46:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116306 states. [2019-09-07 21:46:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116306 to 103664. [2019-09-07 21:46:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103664 states. [2019-09-07 21:46:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103664 states to 103664 states and 117856 transitions. [2019-09-07 21:46:55,490 INFO L78 Accepts]: Start accepts. Automaton has 103664 states and 117856 transitions. Word has length 1064 [2019-09-07 21:46:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:46:55,490 INFO L475 AbstractCegarLoop]: Abstraction has 103664 states and 117856 transitions. [2019-09-07 21:46:55,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 21:46:55,491 INFO L276 IsEmpty]: Start isEmpty. Operand 103664 states and 117856 transitions. [2019-09-07 21:46:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2019-09-07 21:46:55,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:46:55,603 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, 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, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:46:55,603 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:46:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:46:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1184440702, now seen corresponding path program 1 times [2019-09-07 21:46:55,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:46:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:46:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:55,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:46:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:46:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 594 proven. 113 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-09-07 21:46:57,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:46:57,201 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 21:46:57,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:46:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:46:57,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 21:46:57,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:46:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:46:58,231 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 23 [2019-09-07 21:47:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 910 proven. 2 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 21:47:00,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:47:00,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 21:47:00,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 21:47:00,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 21:47:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 21:47:00,245 INFO L87 Difference]: Start difference. First operand 103664 states and 117856 transitions. Second operand 9 states. [2019-09-07 21:47:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:47:22,300 INFO L93 Difference]: Finished difference Result 235206 states and 269036 transitions. [2019-09-07 21:47:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 21:47:22,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1084 [2019-09-07 21:47:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:47:22,547 INFO L225 Difference]: With dead ends: 235206 [2019-09-07 21:47:22,547 INFO L226 Difference]: Without dead ends: 130171 [2019-09-07 21:47:22,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1143 GetRequests, 1107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 21:47:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130171 states. [2019-09-07 21:47:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130171 to 123504. [2019-09-07 21:47:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123504 states. [2019-09-07 21:47:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123504 states to 123504 states and 139229 transitions. [2019-09-07 21:47:23,920 INFO L78 Accepts]: Start accepts. Automaton has 123504 states and 139229 transitions. Word has length 1084 [2019-09-07 21:47:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:47:23,921 INFO L475 AbstractCegarLoop]: Abstraction has 123504 states and 139229 transitions. [2019-09-07 21:47:23,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 21:47:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 123504 states and 139229 transitions. [2019-09-07 21:47:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2019-09-07 21:47:24,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:47:24,036 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, 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:47:24,036 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:47:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:47:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -124680420, now seen corresponding path program 1 times [2019-09-07 21:47:24,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:47:24,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:47:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:47:24,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:47:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:47:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:47:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 552 proven. 302 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2019-09-07 21:47:25,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:47:25,218 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 21:47:25,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:47:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:47:25,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 21:47:25,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:47:25,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:47:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1079 proven. 5 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2019-09-07 21:47:26,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:47:26,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 21:47:26,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 21:47:26,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 21:47:26,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 21:47:26,531 INFO L87 Difference]: Start difference. First operand 123504 states and 139229 transitions. Second operand 8 states. [2019-09-07 21:47:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:47:47,402 INFO L93 Difference]: Finished difference Result 249802 states and 281783 transitions. [2019-09-07 21:47:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 21:47:47,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1111 [2019-09-07 21:47:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:47:47,627 INFO L225 Difference]: With dead ends: 249802 [2019-09-07 21:47:47,627 INFO L226 Difference]: Without dead ends: 125843 [2019-09-07 21:47:47,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-07 21:47:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125843 states. [2019-09-07 21:47:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125843 to 118708. [2019-09-07 21:47:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118708 states. [2019-09-07 21:47:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118708 states to 118708 states and 130600 transitions. [2019-09-07 21:47:48,923 INFO L78 Accepts]: Start accepts. Automaton has 118708 states and 130600 transitions. Word has length 1111 [2019-09-07 21:47:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:47:48,924 INFO L475 AbstractCegarLoop]: Abstraction has 118708 states and 130600 transitions. [2019-09-07 21:47:48,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 21:47:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 118708 states and 130600 transitions. [2019-09-07 21:47:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1315 [2019-09-07 21:47:49,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:47:49,058 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-09-07 21:47:49,058 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:47:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:47:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1574748169, now seen corresponding path program 1 times [2019-09-07 21:47:49,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:47:49,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:47:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:47:49,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:47:49,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:47:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:47:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2681 backedges. 893 proven. 238 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-09-07 21:47:50,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:47:50,811 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 21:47:50,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:47:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:47:51,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 21:47:51,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:47:51,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:47:51,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:47:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2681 backedges. 2087 proven. 6 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-09-07 21:47:53,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:47:53,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 21:47:53,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 21:47:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 21:47:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-07 21:47:53,611 INFO L87 Difference]: Start difference. First operand 118708 states and 130600 transitions. Second operand 13 states. [2019-09-07 21:48:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 21:48:46,255 INFO L93 Difference]: Finished difference Result 342670 states and 400309 transitions. [2019-09-07 21:48:46,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2019-09-07 21:48:46,256 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1314 [2019-09-07 21:48:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 21:48:46,879 INFO L225 Difference]: With dead ends: 342670 [2019-09-07 21:48:46,879 INFO L226 Difference]: Without dead ends: 224393 [2019-09-07 21:48:47,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1436 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18254 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5069, Invalid=37161, Unknown=0, NotChecked=0, Total=42230 [2019-09-07 21:48:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224393 states. [2019-09-07 21:48:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224393 to 195980. [2019-09-07 21:48:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195980 states. [2019-09-07 21:48:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195980 states to 195980 states and 216833 transitions. [2019-09-07 21:48:50,272 INFO L78 Accepts]: Start accepts. Automaton has 195980 states and 216833 transitions. Word has length 1314 [2019-09-07 21:48:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 21:48:50,273 INFO L475 AbstractCegarLoop]: Abstraction has 195980 states and 216833 transitions. [2019-09-07 21:48:50,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 21:48:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 195980 states and 216833 transitions. [2019-09-07 21:48:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1404 [2019-09-07 21:48:50,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 21:48:50,521 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 21:48:50,521 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 21:48:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 21:48:50,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2046341436, now seen corresponding path program 1 times [2019-09-07 21:48:50,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 21:48:50,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 21:48:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:48:50,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 21:48:50,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 21:48:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:48:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 893 proven. 238 refuted. 0 times theorem prover too weak. 1617 trivial. 0 not checked. [2019-09-07 21:48:53,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 21:48:53,461 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) [2019-09-07 21:48:53,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 21:48:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 21:48:53,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 21:48:53,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 21:48:53,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:53,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:48:55,935 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_2 Int)) (let ((.cse0 (mod v_prenex_2 299849))) (let ((.cse1 (+ .cse0 300149))) (and (not (= 0 (mod .cse0 5))) (<= c_~a28~0 (+ (div .cse1 5) 333944)) (< (+ .cse0 300) 0) (<= 0 .cse1) (= 0 .cse0))))) (exists ((v_prenex_2 Int)) (let ((.cse2 (mod v_prenex_2 299849))) (and (not (= 0 (mod .cse2 5))) (<= c_~a28~0 (+ (div (+ .cse2 300149) 5) 333944)) (= (mod (+ .cse2 4) 5) 0) (< (+ .cse2 300) 0) (<= 0 v_prenex_2)))) (exists ((v_~a28~0_1313 Int)) (let ((.cse3 (mod v_~a28~0_1313 299849))) (let ((.cse4 (+ .cse3 300149))) (and (<= 0 (+ .cse3 300)) (= 0 .cse3) (<= c_~a28~0 (+ (div .cse4 5) 333944)) (<= 0 .cse4))))) (exists ((v_prenex_2 Int)) (let ((.cse5 (mod v_prenex_2 299849))) (let ((.cse6 (+ .cse5 300))) (and (not (= 0 (mod .cse5 5))) (< (+ .cse5 300149) 0) (<= c_~a28~0 (+ (div .cse6 5) 333945)) (< .cse6 0) (< v_prenex_2 0) (not (= 0 .cse5)) (not (= (mod (+ .cse5 4) 5) 0)))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse7 (mod v_~a28~0_1313 299849))) (and (= (mod (+ .cse7 4) 5) 0) (<= 0 (+ .cse7 300)) (<= c_~a28~0 (+ (div (+ .cse7 300149) 5) 333944)) (<= 0 v_~a28~0_1313)))) (exists ((v_~a28~0_1313 Int)) (let ((.cse8 (mod v_~a28~0_1313 299849))) (and (= (mod (+ .cse8 4) 5) 0) (= 0 .cse8) (= 0 (mod .cse8 5)) (<= c_~a28~0 (+ (div (+ .cse8 300149) 5) 333944))))) (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 299849))) (let ((.cse10 (+ .cse9 300))) (and (not (= 0 (mod .cse9 5))) (<= c_~a28~0 (+ (div .cse10 5) 333945)) (= (mod (+ .cse9 4) 5) 0) (< .cse10 0) (< v_prenex_2 0) (not (= 0 .cse9)))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse11 (mod v_~a28~0_1313 299849))) (let ((.cse12 (+ .cse11 300149))) (and (<= 0 (+ .cse11 300)) (<= c_~a28~0 (+ (div .cse12 5) 333944)) (<= 0 .cse12) (<= 0 v_~a28~0_1313))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse14 (mod v_~a28~0_1313 299849))) (let ((.cse13 (+ .cse14 300))) (and (<= c_~a28~0 (+ (div .cse13 5) 333944)) (not (= 0 .cse14)) (<= 0 .cse13) (< v_~a28~0_1313 0) (<= 0 (+ .cse14 300149)))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse15 (mod v_~a28~0_1313 299849))) (and (= (mod (+ .cse15 4) 5) 0) (<= 0 (+ .cse15 300)) (= 0 .cse15) (<= c_~a28~0 (+ (div (+ .cse15 300149) 5) 333944))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse16 (mod v_~a28~0_1313 299849))) (let ((.cse17 (+ .cse16 300149))) (and (= 0 .cse16) (< .cse17 0) (= 0 (mod .cse16 5)) (<= c_~a28~0 (+ (div .cse17 5) 333945)) (not (= (mod (+ .cse16 4) 5) 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse18 (mod v_prenex_2 299849))) (and (not (= 0 (mod .cse18 5))) (<= c_~a28~0 (+ (div (+ .cse18 300149) 5) 333944)) (= (mod (+ .cse18 4) 5) 0) (< (+ .cse18 300) 0) (= 0 .cse18)))) (exists ((v_~a28~0_1313 Int)) (let ((.cse19 (mod v_~a28~0_1313 299849))) (let ((.cse20 (+ .cse19 300149))) (and (= 0 .cse19) (= 0 (mod .cse19 5)) (<= c_~a28~0 (+ (div .cse20 5) 333944)) (<= 0 .cse20))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse22 (mod v_~a28~0_1313 299849))) (let ((.cse21 (+ .cse22 300))) (and (<= c_~a28~0 (+ (div .cse21 5) 333944)) (not (= 0 .cse22)) (<= 0 .cse21) (< (+ .cse22 300149) 0) (< v_~a28~0_1313 0) (not (= (mod (+ .cse22 4) 5) 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse23 (mod v_prenex_2 299849))) (let ((.cse24 (+ .cse23 300149))) (and (not (= 0 (mod .cse23 5))) (< .cse24 0) (< (+ .cse23 300) 0) (= 0 .cse23) (not (= (mod (+ .cse23 4) 5) 0)) (<= c_~a28~0 (+ (div .cse24 5) 333945)))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse26 (mod v_~a28~0_1313 299849))) (let ((.cse25 (+ .cse26 300149))) (and (< .cse25 0) (= 0 (mod .cse26 5)) (<= c_~a28~0 (+ (div .cse25 5) 333945)) (not (= (mod (+ .cse26 4) 5) 0)) (<= 0 v_~a28~0_1313))))) (exists ((v_prenex_2 Int)) (let ((.cse27 (mod v_prenex_2 299849))) (let ((.cse28 (+ .cse27 300149))) (and (not (= 0 (mod .cse27 5))) (< .cse28 0) (< (+ .cse27 300) 0) (not (= (mod (+ .cse27 4) 5) 0)) (<= c_~a28~0 (+ (div .cse28 5) 333945)) (<= 0 v_prenex_2))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse29 (mod v_~a28~0_1313 299849))) (and (<= c_~a28~0 (+ (div (+ .cse29 300) 5) 333944)) (not (= 0 .cse29)) (< (+ .cse29 300149) 0) (< v_~a28~0_1313 0) (= 0 (mod .cse29 5)) (not (= (mod (+ .cse29 4) 5) 0))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse30 (mod v_~a28~0_1313 299849))) (and (<= c_~a28~0 (+ (div (+ .cse30 300) 5) 333944)) (not (= 0 .cse30)) (< v_~a28~0_1313 0) (= 0 (mod .cse30 5)) (<= 0 (+ .cse30 300149))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse31 (mod v_~a28~0_1313 299849))) (let ((.cse32 (+ .cse31 300149))) (and (<= 0 (+ .cse31 300)) (= 0 .cse31) (< .cse32 0) (<= c_~a28~0 (+ (div .cse32 5) 333945)) (not (= (mod (+ .cse31 4) 5) 0)))))) (exists ((v_prenex_2 Int)) (let ((.cse33 (mod v_prenex_2 299849))) (let ((.cse34 (+ .cse33 300))) (and (not (= 0 (mod .cse33 5))) (<= c_~a28~0 (+ (div .cse34 5) 333945)) (< .cse34 0) (<= 0 (+ .cse33 300149)) (< v_prenex_2 0) (not (= 0 .cse33)))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse35 (mod v_~a28~0_1313 299849))) (let ((.cse36 (+ .cse35 300149))) (and (= 0 (mod .cse35 5)) (<= c_~a28~0 (+ (div .cse36 5) 333944)) (<= 0 .cse36) (<= 0 v_~a28~0_1313))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse38 (mod v_~a28~0_1313 299849))) (let ((.cse37 (+ .cse38 300))) (and (<= c_~a28~0 (+ (div .cse37 5) 333944)) (not (= 0 .cse38)) (= (mod (+ .cse38 4) 5) 0) (<= 0 .cse37) (< v_~a28~0_1313 0))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse39 (mod v_~a28~0_1313 299849))) (let ((.cse40 (+ .cse39 300149))) (and (<= 0 (+ .cse39 300)) (< .cse40 0) (<= c_~a28~0 (+ (div .cse40 5) 333945)) (not (= (mod (+ .cse39 4) 5) 0)) (<= 0 v_~a28~0_1313))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse41 (mod v_~a28~0_1313 299849))) (and (<= c_~a28~0 (+ (div (+ .cse41 300) 5) 333944)) (not (= 0 .cse41)) (= (mod (+ .cse41 4) 5) 0) (< v_~a28~0_1313 0) (= 0 (mod .cse41 5))))) (exists ((v_~a28~0_1313 Int)) (let ((.cse42 (mod v_~a28~0_1313 299849))) (and (= (mod (+ .cse42 4) 5) 0) (= 0 (mod .cse42 5)) (<= c_~a28~0 (+ (div (+ .cse42 300149) 5) 333944)) (<= 0 v_~a28~0_1313)))) (exists ((v_prenex_2 Int)) (let ((.cse43 (mod v_prenex_2 299849))) (let ((.cse44 (+ .cse43 300149))) (and (not (= 0 (mod .cse43 5))) (<= c_~a28~0 (+ (div .cse44 5) 333944)) (< (+ .cse43 300) 0) (<= 0 .cse44) (<= 0 v_prenex_2)))))) is different from true [2019-09-07 21:49:24,243 WARN L188 SmtUtils]: Spent 23.93 s on a formula simplification. DAG size of input: 433 DAG size of output: 19 [2019-09-07 21:49:24,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:49:24,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:49:28,246 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-07 21:49:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:49:37,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 21:49:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 1292 proven. 56 refuted. 1 times theorem prover too weak. 1398 trivial. 1 not checked. [2019-09-07 21:49:43,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 21:49:43,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 21:49:43,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 21:49:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 21:49:43,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=5, NotChecked=16, Total=110 [2019-09-07 21:49:43,297 INFO L87 Difference]: Start difference. First operand 195980 states and 216833 transitions. Second operand 11 states. [2019-09-07 21:54:17,987 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 52